제출 #865456

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

met

#include <bits/stdc++.h>
 
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define optimus_prime ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define fxd(x) fixed << setprecision(x)
#define all(a) (a.begin() , a.end())
#define popcount(x) __builtin_popcount(x)
#define lwb lower_bound
#define upb upper_bound
#define dl double long
#define ll long long
#define pb push_back
#define sz() size()
#define F first
#define S second
 
using namespace std;
 
const ll N = 3e5+9;
const ll inf=1e9+9;
const ll mod=1e9+7;
const ll P = 37;

map <int , int> mp;

ll n , m , q , p[N] , a[N] , ans[N] , sum[N] , timer;

void solve(){
	cin >> n >> m;
	for (int i = 1 ; i <= m ; i++){
		cin >> p[i];
		mp[i]=p[i];
	}
	for (int i = 1 ; i <= n ; i++)cin >> a[i];
	cin >> q;
	while (q--){
		timer++;
		ll l , r , x;
		cin >> l >> r >> x;
		if (l<=r){
			for (int i = l ; i <= r ; i++){
				sum[mp[i]]+=x;
				if (sum[mp[i]]>=a[mp[i]]&&!ans[mp[i]]){
					ans[mp[i]]=timer;
				}
			}
		}
		else {
			for (int i = l ; i <= m ; i++){
				sum[mp[i]]+=x;
				if (sum[mp[i]]>=a[mp[i]]&&!ans[mp[i]]){
					ans[mp[i]]=timer;
				}
			}
			for (int i = 1 ; i <= r ; i++){
				if (ans[mp[i]])continue;
				sum[mp[i]]+=x;
				if (sum[mp[i]]>=a[mp[i]]&&!ans[mp[i]]){
					ans[mp[i]]=timer;
				}
			}
		}
	}
	for (int i = 1;  i<= n ; i++){
		if (!ans[i])cout << "NIE\n";
		else cout << ans[i] << "\n";
	}
}
	
signed main() {
	optimus_prime;
	solve();
return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 13
• Subtask 7: 0 / 13
• Subtask 8: 0 / 13