結果

問題 No.2650 [Cherry 6th Tune *] セイジャク
ユーザー mjtaimjtai
提出日時 2024-02-23 21:58:49
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 160 ms / 2,500 ms
コード長 4,392 bytes
コンパイル時間 6,743 ms
コンパイル使用メモリ 256,396 KB
実行使用メモリ 19,536 KB
最終ジャッジ日時 2024-02-23 21:59:17
合計ジャッジ時間 8,755 ms
ジャッジサーバーID
（参考情報） 		judge16 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,548 KB
testcase_01 AC 2 ms
6,548 KB
testcase_02 AC 31 ms
8,656 KB
testcase_03 AC 19 ms
6,548 KB
testcase_04 AC 104 ms
13,788 KB
testcase_05 AC 77 ms
13,372 KB
testcase_06 AC 38 ms
7,800 KB
testcase_07 AC 88 ms
13,188 KB
testcase_08 AC 26 ms
6,548 KB
testcase_09 AC 136 ms
19,536 KB
testcase_10 AC 160 ms
19,536 KB
testcase_11 AC 137 ms
19,536 KB
testcase_12 AC 135 ms
19,536 KB
testcase_13 AC 137 ms
19,536 KB
testcase_14 AC 136 ms
19,536 KB
testcase_15 AC 152 ms
19,536 KB
testcase_16 AC 85 ms
19,536 KB
testcase_17 AC 84 ms
19,536 KB
testcase_18 AC 85 ms
19,536 KB
testcase_19 AC 86 ms
19,536 KB
testcase_20 AC 86 ms
19,536 KB
testcase_21 AC 86 ms
19,536 KB
testcase_22 AC 95 ms
19,536 KB
testcase_23 AC 86 ms
19,536 KB
testcase_24 AC 80 ms
19,536 KB
testcase_25 AC 81 ms
19,536 KB
testcase_26 AC 81 ms
19,536 KB
testcase_27 AC 80 ms
19,536 KB
testcase_28 AC 81 ms
19,536 KB
testcase_29 AC 80 ms
19,536 KB
testcase_30 AC 81 ms
19,536 KB
testcase_31 AC 149 ms
19,536 KB
testcase_32 AC 45 ms
11,392 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

///////////////////////////////////////////////////////////////////////////////

#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

///////////////////////////////////////////////////////////////////////////////

typedef long long ll;
typedef unsigned long long ull;
typedef __int128_t ll128;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using binary_search_tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define pb push_back
#define V vector
#define S static
#define SP << " " <<

#define rep(i,n) for(ll i=0LL; i<n; ++i)
#define srep(i,s,n) for(ll i=s; i<n; ++i)
#define rrep(i,n) for(ll i=n-1LL; i>=0LL; --i)
#define rfrep(i,f,n) for(ll i=n-1LL; i>=f; --i)
#define cfor(i,x) for(const auto & (i) : (x))
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CIN(x) do { \
        assert(!cin.eof()); \
        cin >> x; \
        assert(!cin.fail()); \
} while(0);
#define E18(x) ((x) * 1'000'000'000'000'000'000LL)
#ifdef DEBUG
#include "../../../template/debug.h"
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#endif // DEBUG

///////////////////////////////////////////////////////////////////////////////

ll llin()
{
    ll a; CIN(a); return a;
}

V<ll> llina(ll count)
{
    V<ll> v;
    for (ll i = 0LL; i < count; ++i) {
        ll a; CIN(a); v.push_back(a);
    }
    return v;
}

V<V<ll>> llinaa(ll h, ll w)
{
    V<V<ll>> v(h, V<ll>(w));
    rep (hh, h) rep (ww, w) {
        ll a; CIN(a); v[hh][ww] = a;
    }
    return v;
}

V<t2> llinl2(ll count)
{
    V<t2> v;
    for (ll i = 0LL; i < count; ++i) {
        ll a, b; CIN(a >> b); v.push_back(t2(a, b));
    }
    return v;
}

V<t3> llinl3(ll count)
{
    V<t3> v;
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c; CIN(a >> b >> c); v.push_back(t3(a, b, c));
    }
    return v;
}

V<t4> llinl4(ll count)
{
    V<t4> v;
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c, d; CIN(a >> b >> c >> d); v.push_back(t4(a, b, c, d));
    }
    return v;
}

string strin()
{
    string s; CIN(s); return s;
}

V<string> strina(ll count)
{
    V<string> slist(count);
    for (ll i = 0; i < count; ++i) CIN(slist[i]);
    return slist;
}

template <typename T>
void sort(V<T> &v)
{
    sort(v.begin(), v.end());
}

template <typename T>
void sort_reverse(V<T> &v)
{
    sort(v.begin(), v.end(), greater<T>());
}

t2 _ext_gcd(ll a, ll b, ll g)
{
    if (!b) return t2(1, 0);
    ll q = a / b;
    ll r = a % b;
    auto [sx, sy] = _ext_gcd(b, r, g);
    ll x = sy;
    ll y = sx - q * sy;
    return t2(x, y);
}

t2 ext_gcd(ll a, ll b)
{
    return _ext_gcd(a, b, gcd(a, b));
}

// x and mod must be coprime
ll mod_inv(ll x, ll mod)
{
    auto [ret, xxxx] = ext_gcd(x, mod);
    while (ret < 0) ret += mod;
    ret %= mod;
    return ret;
}

///////////////////////////////////////////////////////////////////////////////

void _main();
int main()
{
    cout << setprecision(12);
#ifndef DEBUG
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif // DEBUG

    _main();
    return 0;
}

///////////////////////////////////////////////////////////////////////////////

void _main()
{
    ll n = llin();
    ll a = llin();
    V<ll> xlist = llina(n);
    ll t = llin();
    V<t2> lrs = llinl2(t);

    V<t3> events;
    rep (i, n) events.pb(t3(xlist[i], 100, i));
    rep (i, t) {
        auto [left, right] = lrs[i];
        ll si = left;
        ll ei = right + 1;
        events.pb(t3(si, 1, i));
        events.pb(t3(ei, -1, i));
    }
    sort(events);

    V<ll> anslist(n);
    set<ll> sounds;

    for (auto [x, typ, i] : events) {
        if (typ == 100) {
            if (sounds.empty()) {
                anslist[i] = -2;
            }
            else {
                anslist[i] = *sounds.rbegin();
            }
        }

        if (typ == 1) {
            sounds.insert(i);
        }

        if (typ == -1) {
            sounds.erase(i);
        }
    }

    cfor (ans, anslist) cout << ans + 1 << "\n";
}

///////////////////////////////////////////////////////////////////////////////
0