Submission #761858

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
761858	2023-06-20T10:33:48 Z	vjudge1	Meteors (POI11_met)	C++17	39 / 100	3117 ms	37796 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 = 400;
 

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];
		origp[i] = p[i];
	}
	cin>>k;
	for(ll 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(ll j = 1; j<=m; j++) {
				scan[j] += scan[j - 1];
				p[o[j]] -= scan[j];
				if(p[o[j]] <= 0 && p[o[j]] + scan[j] > 0) {
					ansblock[o[j]] = (i + B - 1) / B;
					vec.pb(o[j]);
				}
			}
			
			for(auto x : vec) {
				ll start = max(1ll, ansblock[x] * B - B + 1), final = i;
				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(ll j = 0; j<=m + 1; j++) {
				scan[j] = 0;
				if(1 <= j && j <= m) origp[o[j]] = p[o[j]];
			}
		}
	}
	for(ll 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(); }
}

Subtask #1
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	5 ms	9812 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	6 ms	9812 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	41 ms	12364 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	109 ms	12696 KB	Output is correct
2	Correct	127 ms	12688 KB	Output is correct
3	Incorrect	212 ms	13524 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #5
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	49 ms	12492 KB	Output is correct
2	Correct	91 ms	13396 KB	Output is correct
3	Correct	15 ms	10892 KB	Output is correct
4	Correct	121 ms	13124 KB	Output is correct

Subtask #6
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	51 ms	12252 KB	Output is correct
2	Incorrect	98 ms	12656 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #7
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2062 ms	31044 KB	Output is correct
2	Correct	837 ms	23876 KB	Output is correct
3	Correct	45 ms	15684 KB	Output is correct
4	Correct	3117 ms	35712 KB	Output is correct

Subtask #8
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2001 ms	29920 KB	Output is correct
2	Correct	831 ms	23984 KB	Output is correct
3	Correct	43 ms	14412 KB	Output is correct
4	Correct	2975 ms	37796 KB	Output is correct

Submission #761858

Compilation message