Submission #938746

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