제출 #761924

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
761924		vjudge1	새로운 문제 (POI11_met)	C++17	39 / 100	3980 ms	37876 KiB

met

#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], sum[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]] = -1;
		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(ll j = 1; j<=m; j++) scan[j] += scan[j - 1];
			for(ll j = 1; j<=n; j++) sum[j] = 0;
			for(ll j = 1; j<=m; j++) sum[o[j]] += scan[j];
			for(ll j = 1; j<=n; j++) {
				if(ans[j] != -1 || ansblock[j] != -1) continue;
				if(p[j] <= sum[j]) {
					vec.pb(j);
					ansblock[j] = (i + B - 1) / B;
				}
			}
			for(ll j = 1; j<=n; j++) sum[j] = 0;
			ll thisblock = (i + B - 1) / B;
			ll start = max(1ll, thisblock * B - B + 1), final = i;
			for(ll j = start; j <= final; j++) {
				for(auto x : vec) {
					ll L, R;
					if(ql[j] > qr[j]) {
						L = ql[j], R = m;
						ll cnt = upper_bound(all(pos[x]), R) - pos[x].begin() - (lower_bound(all(pos[x]), L) - pos[x].begin());
						sum[x] += cnt * qa[j];
						
						L = 1, R = qr[j];
						cnt = upper_bound(all(pos[x]), R) - pos[x].begin() - (lower_bound(all(pos[x]), L) - pos[x].begin());
						
						sum[x] += cnt * qa[j];
						if(p[x] <= sum[x] && ans[x] == -1) {
							ans[x] = j;
						}
						
 					}
 					else {
 						L = ql[j], R = qr[j];
						ll cnt = upper_bound(all(pos[x]), R) - pos[x].begin() - (lower_bound(all(pos[x]), L) - pos[x].begin());
						sum[x] += cnt * qa[j];
						if(p[x] <= sum[x] && ans[x] == -1) {
							ans[x] = j;
						}
					}
				}
			}
			for(ll j = 1; j<=m; j++) {
				p[o[j]] -= scan[j];
				scan[j] = 0;
			}
			
		}
	}
	for(int i = 1; i<=n; i++) {
		if(ans[i] == -1) 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
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 13 / 13
• Subtask 6: 0 / 13
• Subtask 7: 13 / 13
• Subtask 8: 13 / 13