Submission #1333502

#TimeUsernameProblemLanguageResultExecution timeMemory
1333502ozner77Meteors (POI11_met)C++17
24 / 100
6094 ms9788 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
    ll n,m;
    cin>>n>>m;
    map<ll,ll> M;
    vector<ll> ans(n,-1);
    vector<ll> V;
    for(int i=0;i<m;i++){
        ll a;
        cin>>a;
        a--;
        V.push_back(a);
    }
    for(int i=0;i<n;i++){
        ll a;
        cin>>a;
        M[i]=a;
    }
    ll q;
    cin>>q;
    for(int i=0;i<q;i++){
        ll a,b,c;
        cin>>a>>b>>c;
        a--;
        b--;
        while(a!=b){
            M[V[a]]-=c;
            if(ans[V[a]]==-1 && M[V[a]]<=0){
                ans[V[a]]=i+1;
            }
            a++;
            if(a==m){
                a=0;
            }
        }
         M[V[a]]-=c;
            if(ans[V[a]]==-1 && M[V[a]]<=0){
                ans[V[a]]=i+1;
            }
            a++;
            if(a==m){
                a=0;
            }
    }
    for(auto x:ans){
        if(x==-1){
            cout<<"NIE\n";
        }else{
            cout<<x<<"\n";
        }
    }
}
#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...