oj.uz

Submission #920405

# Submission time Handle Problem Language Result Execution time Memory
920405 2024-02-02T14:15:34 Z NotLinux Meteors (POI11_met) C++17
74 / 100
 1289 ms 52544 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
struct SEGT{
    vector < int > t;
    int tree_size;
    const int identity_element = 0;
    int merge(int x , int y){ 
        return min(inf , x + y);
    }
    void init(int x){
        tree_size = x+3;
        t.assign(2*tree_size , identity_element);
    }
    void modify(int p, int value) {  // set value at position p
        for (t[p += tree_size] += value; p > 1; p >>= 1){
            t[p>>1] = merge(t[p] , t[p^1]); 
        }
    }
    int _query(int l, int r) {  // sum on interval [l, r]
        int res = identity_element;
        for (r+=1 , l += tree_size, r += tree_size; l < r; l >>= 1, r >>= 1) {
            if (l&1) res = merge(res , t[l++]); 
            if (r&1) res = merge(res , t[--r]); 
        }
        return res;
    }
    void rangeupdate(int l , int r , int val){
        // cout << "rangeupdate : " << l << " " << r << " " << val << endl;
        modify(l , val);
        modify(r+1 , -val);
    }
    int query(int p){
        return _query(0,p);
    }
};
void solve(){
    int n,m;cin >> n >> m;
    vector < int > devlet[n+1];
    for(int i = 1;i<=m;i++){
        int x;cin >> x;
        devlet[x].push_back(i);
    }
    int need[n+1];
    for(int i = 1;i<=n;i++){
        cin >> need[i];
    }
    int q;cin >> q;
    vector < array < int , 3 > > query(q+1);
    for(int i = 1;i<=q;i++){
        cin >> query[i][0] >> query[i][1] >> query[i][2];
    }

    vector < array < int , 3 > > paralel[q+2],nparalel[q+2];
    for(int i = 1;i<=n;i++){
        paralel[(1+q+1)/2].push_back({i,1,q+1});
    }
    for(int i = 0;i<=19;i++){
        SEGT fen;
        fen.init(m+10);
        for(int j = 1;j<=q;j++){
            if(query[j][0] <= query[j][1]){
                fen.rangeupdate(query[j][0],query[j][1],query[j][2]);
            }
            else{
                fen.rangeupdate(1,query[j][1],query[j][2]);
                fen.rangeupdate(query[j][0],m+1,query[j][2]);
            }
            // cout << "j : ";for(int k = 1;k<=m;k++)cout << fen._query(k,k) << " ";cout << endl;
            for(auto itr : paralel[j]){
                if(itr[1] == itr[2]){
                    nparalel[j].push_back(itr);
                    continue;
                }
                int cur = 0;
                for(auto itr1 : devlet[itr[0]]){
                    cur = min(inf , cur + fen.query(itr1));
                }
                if(cur >= need[itr[0]]){//r = mid;
                    int mid = (itr[1] + j)/2;
                    nparalel[mid].push_back({itr[0],itr[1],j});
                }
                else {//l = mid
                    int mid = (j+1 + itr[2])/2;
                    nparalel[mid].push_back({itr[0],j+1,itr[2]});
                }
            }
        }
        for(int j = 1;j<=q;j++){
            paralel[j].swap(nparalel[j]);
            nparalel[j].clear();
        }
    }
    int ans[n+1];
    memset(ans , -1 , sizeof(ans));
    for(int j = 1;j<=q;j++){
        for(auto itr : paralel[j]){
            ans[itr[0]] = j;
        }
    }
    for(int i = 1;i<=n;i++){
        if(ans[i] == -1)cout << "NIE" << '\n';
        else cout << ans[i] << '\n';
    }
}
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int testcase = 1;//cin >> testcase;
    while(testcase--)solve();
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 2 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 2 ms 856 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 5300 KB Output is correct
2 Correct 148 ms 10440 KB Output is correct
3 Correct 133 ms 8328 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 7308 KB Output is correct
2 Correct 137 ms 7572 KB Output is correct
3 Correct 152 ms 10792 KB Output is correct
4 Correct 54 ms 4984 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 5832 KB Output is correct
2 Correct 137 ms 10980 KB Output is correct
3 Correct 43 ms 3416 KB Output is correct
4 Correct 130 ms 9412 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 4296 KB Output is correct
2 Correct 137 ms 7416 KB Output is correct
3 Correct 102 ms 4752 KB Output is correct
4 Correct 154 ms 12280 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1267 ms 52544 KB Output is correct
2 Incorrect 1055 ms 21716 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1289 ms 49480 KB Output is correct
2 Incorrect 722 ms 21664 KB Output isn't correct
3 Halted 0 ms 0 KB -