This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define f first
#define s second
#define ent '\n'
#define int long long
//typedef long double ld;
typedef long long ll;
using namespace std;
const int mx=1e6 + 100;
const bool T=0;
int p[mx] , s[mx] , ans[mx] , a[mx];
int n,m,t;
void solve(){
cin >> n >> m;
for(int i = 1;i <= m;i++)cin >> p[i];
for(int i = 1;i <= n;i++)cin >> a[i];
cin >> t;
for(int j = 1;j <= t;j++){
int l , r , x;
cin >> l >> r >> x;
if(l <= r){
for(int i = l;i <= r;i++){
s[p[i]]+=x;
if(s[p[i]] >= a[p[i]] and ans[p[i]] == 0){
ans[p[i]] = j;
}
}
}
else{
for(int i = l;i <= m;i++){
s[p[i]]+=x;
if(s[p[i]] >= a[p[i]] and ans[p[i]] == 0){
ans[p[i]] = j;
}
}
for(int i = 1;i <= r;i++){
s[p[i]]+=x;
if(s[p[i]] >= a[p[i]] and ans[p[i]] == 0){
ans[p[i]] = j;
}
}
}
}
for(int i = 1;i <= n;i++){
if(ans[i] == 0)cout<<"NIE"<<ent;
else cout<<ans[i]<<ent;
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tt=1;
if(T)cin>>tt;
for(int i=1;i<=tt;i++){
solve();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |