제출 #1333494

#제출 시각아이디문제언어결과실행 시간메모리
1333494adriines06새로운 문제 (POI11_met)C++20
74 / 100
6089 ms8416 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
    int n,m; cin>>n>>m;
    vector<int>v(m);
    vector<int>v2(n);
    vector<vector<int>>sec(n);
    for(int i=0;i<m;i++){
        cin>>v[i];
        v[i]--;
        sec[v[i]].push_back(i);
    }
    for(int &x: v2) cin>>x;
    int k; cin>>k;
    vector<int>sp(n,0);
    for(int i=0;i<k;i++){
        int l,r,a; cin>>l>>r>>a;
        l--, r--;
        int j=l;
        while(true) {
            if(j==m) {
                j=0;
                continue;
            }
            int st=v[j];
            if(sp[st] >=0) {
                sp[st]+= a;
            }
            if(sp[st] >= v2[st]) {
                sp[st] =-i-1;
            }
            if(j == r) break;
            j++;
        }

    }
    for(int i=0;i<n;i++) {
        if(sp[i]<0) cout<<-sp[i]<<"\n";
        else cout<<"NIE\n";
        
    }

    

}
int main(){
    ios::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    solve();
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...