oj.uz

Submission #257942

# Submission time Handle Problem Language Result Execution time Memory
257942 2020-08-05T05:37:20 Z Autoratch Meteors (POI11_met) C++14
74 / 100
 1385 ms 45880 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1 << 19;

int n,m,q;
int bl[N],need[N];
vector<int> wh[N];
int l[N],r[N];
vector<int> ask[N];
vector<tuple<int,int,int> > inp;
long long fw[N];

void update(int idx,long long val){ while(idx<N) fw[idx]+=val,idx+=(idx & -idx); }

long long read(int idx){ if(idx==0) return 0; long long val = 0; while(idx>0) val+=fw[idx],idx-=(idx & -idx); return val; }

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> m;
    for(int i = 1;i <= m;i++) cin >> bl[i],wh[bl[i]].push_back(i);
    for(int i = 1;i <= n;i++) cin >> need[i];
    cin >> q;
    for(int i = 1;i <= q;i++)
    {
        int l,r,k;
        cin >> l >> r >> k;
        inp.push_back({l,r,k});
    }
    for(int i = 1;i <= n;i++) l[i] = 1,r[i] = q+1;
    while(true)
    {
        bool done = true;
        for(int i = 1;i <= n;i++) if(l[i]<r[i]) done = false,ask[(l[i]+r[i])/2].push_back(i);
        if(done) break;
        for(int i = 1;i <= m;i++) fw[i] = 0;
        for(int i = 1;i <= q;i++)
        {
            auto [ll,rr,k] = inp[i-1];
            if(ll<=rr) update(ll,k),update(rr+1,-k);
            else update(1,k),update(rr+1,-k),update(ll,k);
            for(int x : ask[i]) 
            {
                long long tmp = 0;
                for(int y : wh[x]) tmp+=read(y);
                if(tmp>=need[x]) r[x] = i;
                else l[x] = i+1;
            }
            ask[i].clear();
        }
    }
    for(int i = 1;i <= n;i++) if(l[i]<=q) cout << l[i] << '\n'; else cout << "NIE\n";
}

Compilation message

met.cpp: In function 'int main()':
met.cpp:41:18: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
             auto [ll,rr,k] = inp[i-1];
                  ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 25088 KB Output is correct
2 Correct 18 ms 25084 KB Output is correct
3 Correct 17 ms 25088 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 25088 KB Output is correct
2 Correct 17 ms 25088 KB Output is correct
3 Correct 18 ms 25088 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 27060 KB Output is correct
2 Correct 161 ms 28908 KB Output is correct
3 Correct 139 ms 28656 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 28076 KB Output is correct
2 Correct 134 ms 28100 KB Output is correct
3 Correct 160 ms 29168 KB Output is correct
4 Correct 47 ms 27384 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 27504 KB Output is correct
2 Correct 191 ms 29648 KB Output is correct
3 Correct 138 ms 25980 KB Output is correct
4 Correct 147 ms 29040 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 26784 KB Output is correct
2 Correct 148 ms 28148 KB Output is correct
3 Correct 104 ms 26864 KB Output is correct
4 Correct 159 ms 30344 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1145 ms 45880 KB Output is correct
2 Incorrect 1385 ms 33896 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1133 ms 44504 KB Output is correct
2 Incorrect 763 ms 33892 KB Output isn't correct
3 Halted 0 ms 0 KB -