| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 761893 |
2023-06-20T11:05:17 Z |
Baizho |
Meteors (POI11_met) |
C++17 |
|
6000 ms |
23140 KB |
#include <bits/stdc++.h>
using namespace std;
// #pragma comment(linker, "/stack:2000000000")
// #pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const int MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(4e5)+10;
const long long inf = 1e18;
//const int inf = 1e9;
const long double eps = 1e-15L;
const ll B = 2;
ll n, m, o[N], p[N], k, ansblock[N], ans[N], ql[N], qr[N], qa[N];
ll scan[N], origp[N];
vector<ll>pos[N];
void Baizho() {
cin>>n>>m;
for(int i = 1; i<=m; i++) {
cin>>o[i];
ans[o[i]] = ansblock[o[i]] = inf;
pos[o[i]].pb(i);
}
for(int i = 1; i<=n; i++) {
cin>>p[i];
}
cin>>k;
for(int i = 1; i<=k; i++) {
ll l, r, a;
cin>>l>>r>>a;
ql[i] = l;
qr[i] = r;
qa[i] = a;
if(l > r) {
scan[l] += a;
scan[m + 1] -= a;
scan[1] += a;
scan[r + 1] -= a;
}
else {
scan[l] += a;
scan[r + 1] -= a;
}
if(i == k || i % B == 0) {
vector<ll> vec;
for(int j = 1; j<=m; j++) {
scan[j] += scan[j - 1];
p[o[j]] -= scan[j];
if(p[o[j]] <= 0 && ansblock[o[j]] == inf) {
ansblock[o[j]] = (i + B - 1) / B;
vec.pb(o[j]);
}
}
for(ll j = 1; j<=m; j++) {
p[o[j]] += scan[j];
}
for(ll j = 1; j<=n; j++) {
origp[j] = p[j];
}
for(auto x : vec) {
ll start = max(1ll, ansblock[x] * B - B + 1), final = i;
// cout<<x<<" "<<start<<" "<<final<<"\n";
for(ll h = start; h <= final; h++) {
ll L, R;
if(ql[h] > qr[h]) {
L = ql[h], R = m;
ll cnt = upper_bound(all(pos[x]), R) - pos[x].begin() - (lower_bound(all(pos[x]), L) - pos[x].begin());
origp[x] -= cnt * qa[h];
L = 1, R = qr[h];
cnt = upper_bound(all(pos[x]), R) - pos[x].begin() - (lower_bound(all(pos[x]), L) - pos[x].begin());
origp[x] -= cnt * qa[h];
if(origp[x] <= 0) {
ans[x] = min(ans[x], h);
}
}
else {
L = ql[h], R = qr[h];
ll cnt = upper_bound(all(pos[x]), R) - pos[x].begin() - (lower_bound(all(pos[x]), L) - pos[x].begin());
origp[x] -= cnt * qa[h];
if(origp[x] <= 0) {
ans[x] = min(ans[x], h);
}
}
}
}
for(int j = 0; j<=m + 1; j++) {
p[o[j]] -= scan[j];
scan[j] = 0;
}
}
}
for(int i = 1; i<=n; i++) {
if(ans[i] == inf) cout<<"NIE\n";
else cout<<ans[i]<<"\n";
}
}
int main() {
// Freopen("guard");
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int ttt = 1;
// cin>>ttt;
for(int i=1; i<=ttt; i++) {Baizho(); }
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
7 ms |
9812 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
7 ms |
9812 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
6061 ms |
11992 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
6069 ms |
12628 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5582 ms |
12560 KB |
Output is correct |
| 2 |
Execution timed out |
6057 ms |
13300 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
6072 ms |
12120 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
6039 ms |
23140 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
6064 ms |
22416 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
