Submission #1306274

#	Time	Username	Problem	Language	Result	Execution time	Memory
1306274		Tymond	새로운 문제 (POI11_met)	C++20	74 / 100	3354 ms	27724 KiB

met

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int MAXN = 3e5 + 7;
const int BASE = (1 << 19);
vi pos[MAXN];
ll tree[2 * BASE + 7];
int req[MAXN];
pii range[MAXN];
vi ind[MAXN];
int n, m, q;
vector<pair<pii, int>> updates;

void upd(int v, int l, int p, int a, int b, int val){
    if(p < a || b < l || a > b){
        return;
    }

    if(a <= l && p <= b){
        tree[v] = (ll)tree[v] + val;
        return;
    }
    int mid = (l + p) / 2;
    upd(2 * v, l, mid, a, b, val);
    upd(2 * v + 1, mid + 1, p,a, b, val);
}

ll query(int v){
    v += BASE;
    ll res = 0LL;
    while(v > 0){
        res += tree[v];
        v /= 2;
    }
    return res;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    
    cin >> n >> m;
    for(int i = 1; i <= m; i++){
        int x;
        cin >> x;
        pos[x].pb(i);
    }

    for(int i = 1; i <= n; i++){
        cin >> req[i];
    }

    cin >> q;
    updates.resize(q);
    for(int i = 0; i < q; i++){
        cin >> updates[i].fi.fi >> updates[i].fi.se >> updates[i].se;
    }

    for(int i = 1; i <= n; i++){
        range[i] = mp(0, q);
    }

    while(true){
        bool f = 0;
        for(int i = 1; i <= n; i++){
            if(range[i].fi < range[i].se){
                f = 1;
            }
        }

        if(!f){
            break;
        }

        for(int i = 1; i <= n; i++){
            ind[(range[i].fi + range[i].se) / 2].pb(i);
        }

        for(int i = 0; i < q; i++){
            if(updates[i].fi.fi <= updates[i].fi.se){
                upd(1, 0, BASE - 1, updates[i].fi.fi, updates[i].fi.se, updates[i].se);
            }else{
                upd(1, 0, BASE - 1, 1, updates[i].fi.se, updates[i].se);
                upd(1, 0, BASE - 1, updates[i].fi.fi, m, updates[i].se);
            }
            ll sum = 0LL;
            for(auto& ele : ind[i]){
                sum = 0LL;
                for(auto& p : pos[ele]){
                    sum += query(p);
                }

                if(sum >= req[ele]){
                    range[ele].se = i;
                }else{
                    range[ele].fi = i + 1;
                }
            }
        }

        for(int i = 0; i < q; i++){
            vi().swap(ind[i]);
        }

        for(int i = 1; i < 2 * BASE; i++){
            tree[i] = 0LL;
        }
    }

    for(int i = 1; i <= n; i++){
        if(range[i].fi == q){
            cout << "NIE\n";
        }else{
            cout << range[i].fi + 1 << '\n';
        }
    }

    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 13 / 13
• Subtask 6: 13 / 13
• Subtask 7: 0 / 13
• Subtask 8: 0 / 13