Submission #938755

#TimeUsernameProblemLanguageResultExecution timeMemory
938755vjudge1Toll (BOI17_toll)C++17
7 / 100
183 ms984 KiB
#include <bits/stdc++.h> #define int long long #define endl "\n" using namespace std; vector<int>tree; signed main(){ int k,n,m,o; cin>>k>>n>>m>>o; for(int i=0;i<n;i++)tree.push_back(-1); for(int i=0;i<m;i++){ int a,b,t; cin>>a>>b>>t; tree[a]=t; } for(int i=0;i<o;i++){ int a,b; cin>>a>>b; int sum=0; bool flag=false; for(int j=a;j<b;j++){ if(tree[j]==-1){ flag=true; }else{ sum+=tree[j]; } } if(flag==true){ cout<<-1<<endl; }else{ cout<<sum<<endl; } } }
#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...