## Submission #926315

# Submission time Handle Problem Language Result Execution time Memory
926315 2024-02-12T19:17:23 Z VMaksimoski008 Meteors (POI11_met) C++14
74 / 100
136 ms 65536 KB
```#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()

using namespace std;
using ll = long long;

void setIO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}

struct BIT {
int n, n2;
vector<ll> tree, val;

void config(int _n) {
n = _n + 10;
n2 = _n;
tree.resize(_n+60);
val.resize(_n+60);
}

void add(int p, int v) {
val[p] += v;
for(p++; p<n; p+=p&-p) tree[p] += v;
}

ll query(int p) {
ll ans = 0;
for(p++; p>0; p-=p&-p) ans += tree[p];
return ans;
}

ll sum(int l, int r) { return query(r) - query(l-1); }
void set(int p, int v) { add(p, v - val[p]); }

void clear() {
for(ll &x : tree) x = 0;
for(ll &x : val) x = 0;
}
};

struct Query { int l, r, x; };

int32_t main() {
setIO();

int n, m;
cin >> n >> m;

vector<vector<int> > owner(n+5);
for(int i=1; i<=m; i++) {
int x;
cin >> x;
owner[x].push_back(i);
}

vector<ll> req(n+5);
for(int i=1; i<=n; i++) cin >> req[i];

int k;
cin >> k;
vector<Query> qus(k+5);
for(int i=1; i<=k; i++)
cin >> qus[i].l >> qus[i].r >> qus[i].x;

vector<int> L(n+5, 1), R(n+5, k+1);
bool changed = true;

BIT bit;
bit.config(m+1);
vector<stack<int> > to_check(k+5);
Query q;
while(changed) {
changed = false;

bit.clear();

for(int i=1; i<=n; i++)
if(L[i] != R[i]) to_check[(L[i]+R[i])/2].push(i);

for(int it=1; it<=k; it++) {
q = qus[it];

if(q.l <= q.r) {
} else {

}

while(!to_check[it].empty()) {
changed = true;

int u = to_check[it].top();
to_check[it].pop();

ll total = 0;
for(int &x : owner[u]) {
total += bit.query(x);
if(total > req[u]) break;
}

if(total >= req[u]) R[u] = it;
else L[u] = it + 1;
}
}
}

for(int i=1; i<=n; i++) {
if(L[i] <= k) cout << L[i] << '\n';
else cout << "NIE\n";
}
return 0;
}```

#### Subtask #1 12.0 / 12.0

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

#### Subtask #2 12.0 / 12.0

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

#### Subtask #3 12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 36696 KB Output is correct
2 Correct 98 ms 38484 KB Output is correct
3 Correct 85 ms 37652 KB Output is correct

#### Subtask #4 12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 37400 KB Output is correct
2 Correct 91 ms 37424 KB Output is correct
3 Correct 95 ms 38580 KB Output is correct
4 Correct 29 ms 6236 KB Output is correct

#### Subtask #5 13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 36440 KB Output is correct
2 Correct 88 ms 38348 KB Output is correct
3 Correct 49 ms 35152 KB Output is correct
4 Correct 90 ms 37952 KB Output is correct

#### Subtask #6 13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 36696 KB Output is correct
2 Correct 102 ms 37780 KB Output is correct
3 Correct 69 ms 36692 KB Output is correct
4 Correct 100 ms 38620 KB Output is correct

#### Subtask #7 0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 136 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

#### Subtask #8 0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 122 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -