oj.uz

Submission #938748

# Submission time Handle Problem Language Result Execution time Memory
938748 2024-03-05T13:41:32 Z vjudge1 Toll (BOI17_toll) C++17
0 / 100
 51 ms 984 KB 
#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<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;
    }
    
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 984 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 984 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 984 KB Output isn't correct
2 Halted 0 ms 0 KB -