| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 497037 |
2021-12-22T08:55:56 Z |
Ierus |
Meteors (POI11_met) |
C++17 |
|
10 ms |
1624 KB |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize ("unroll-loops","O3")
#define F first
#define S second
#define sz size()
#define pb push_back
#define int long long
#define all(x) (x).begin(),(x).end()
#define NFS ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) ;
const int N = 100;
int n, m, que, a[N], t[N<<2], md[N<<2];
void P(int v, int l, int r){
if(md[v] != 0){
if(l != r){
md[v<<1|1] += md[v];
md[v<<1] += md[v];
t[v<<1|1] += md[v];
t[v<<1] += md[v];
}
}
md[v] = 0;
}
void U(int l, int r, int val, int v, int tl, int tr){
P(v,tl,tr);
// cerr << "l: " << l << " r: " << r << " val: " << val << " tl: " << tl << " tr: " << tr << '\n';
if(tl > r || tr < l || tr < tl) return;
if(l <= tl && tr <= r){
md[v] += val;
t[v] += val;
P(v,tl,tr);
return;
}
int tm = tl + tr >> 1;
U(l,r,val,v<<1,tl,tm);
U(l,r,val,v<<1|1,tm+1,tr);
t[v] = t[v<<1] + t[v<<1|1];
}
int G(int pos, int v, int l, int r){
P(v,l,r);
if(l == r) return t[v];
int m = l + r >> 1;
if(pos <= m) return G(pos,v<<1,l,m);
else return G(pos,v<<1|1,m+1,r);
}
vector<int> g[N], ans(N, -1);
int p[N], Q[N], L[N], R[N];
struct{int l, r, a;}q[N];
signed main(){
cin >> n >> m;
for(int i = 1; i <= m; ++i){
int x; cin >> x;
g[x].pb(i);
}
for(int i = 1; i <= n; ++i){
cin >> p[i];
}
int que;
cin >> que;
for(int i = 1; i <= n; ++i){
cin >> q[i].l >> q[i].r >> q[i].a;
}
for(int i = 1; i <= n; ++i){
L[i] = 1, R[i] = que+1;
}
cerr << "ok\n";
bool ok = 1;
while(ok){
ok = false;
memset(t, 0, sizeof(t));
vector<int> tocheck[N];
for(int i = 1; i <= n; ++i){
if(L[i] < R[i]){
tocheck[L[i]+R[i]>>1].pb(i);
}
}
// for(int i = 1; i <= n; ++i){
// if(tocheck[i].size()){
// cerr << i << ": ";
// for(auto x: tocheck[i]) cerr << x << ' ';
// cerr << '\n';
// }
// }
for(int i = 1; i <= que; ++i){
if(q[i].l > q[i].r){
U(q[i].l, m, q[i].a, 1, 1, m);
// exit(false);
U(1, q[i].r, q[i].a, 1, 1, m);
}else{
U(q[i].l, q[i].r, q[i].a, 1, 1, m);
}
// cerr << "L: " << q[i].l << " R: " << q[i].r << " a: " << q[i].a << '\n';
// for(int i = 1; i <= m; ++i){
// cerr << G(i,1,1,m) << ' ';
// }cerr << '\n';
// exit(false);
// cerr << "norm\n";
// cerr << "i: " << i << '\n';
for(auto id: tocheck[i]){
// cerr << "id: " << id << '\n';
ok = true;
long long sum = 0;
for(auto x : g[id]){
// cerr << x << ' ';
sum += G(x, 1, 1, m);
if(sum >= p[id]){
break;
}
}
// cerr << '\n';
// cerr << "sum: " << sum << '\n';
if(sum >= p[id]){
ans[id] = i;
R[id] = i;
}else L[id] = i + 1;
}
}
}
for(int i = 1; i <= n; ++i){
if(ans[i] == -1) cout << "NIE\n";
else cout << ans[i] << '\n';
}
}
Compilation message
met.cpp: In function 'void U(long long int, long long int, long long int, long long int, long long int, long long int)':
met.cpp:35:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
35 | int tm = tl + tr >> 1;
| ~~~^~~~
met.cpp: In function 'long long int G(long long int, long long int, long long int, long long int)':
met.cpp:43:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
43 | int m = l + r >> 1;
| ~~^~~
met.cpp: In function 'int main()':
met.cpp:75:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
75 | tocheck[L[i]+R[i]>>1].pb(i);
| ~~~~^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
2 ms |
460 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
10 ms |
1624 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
2 ms |
460 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
