oj.uz

Submission #938786

# Submission time Handle Problem Language Result Execution time Memory
938786 2024-03-05T14:22:36 Z vjudge1 Toll (BOI17_toll) C++17
7 / 100
 149 ms 984 KB 
#include <bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std;
signed main(){
    int k,n,m,o;
    cin>>k>>n>>m>>o;
    if(k==1){
        vector<int>tree;
        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;
            }
        }
    }else if (o<=3000){
        vector<vector<int>>tree;
        tree.resize(n);
        for(int i=0;i<n;i++){
            for(int j=0;j<k;j++)tree[i].push_back(-1);
        }
        for(int i=0;i<m;i++){
            int a,b,t;
            cin>>a>>b>>t;
            int b1=b%k;
            tree[a][b1]=t;
        }  
        for(int i=0;i<o;i++){
            int a,b;
            cin>>a>>b;  
            int a1=a/k;
            int b1=b/k; 
            int B=b%k;
            vector<int>shortest=tree[a];
            int ans;
            for(int j=a1+1;j<b1+1;j++){
                vector<int>novi(k,INT_MAX);
                for(int r=0;r<k;r++){
                    for(int l=0;l<k;l++){
                        int current=j*k+r;
                        if(current==b)ans=shortest[B];
                        if(shortest[r]!=-1&&tree[current][l]!=-1){
                            novi[l]=min(novi[l],shortest[r]+tree[current][l]);
                        }
                    }
                }
                for(int r=0;r<k;r++){
                    if(novi[r]==INT_MAX){
                        shortest[r]=-1;
                    }else shortest[r]=novi[r];
                }
            }
            cout<<ans<<endl;
        }
    }else{
        
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 980 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 2 ms 448 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 109 ms 984 KB Output is correct
9 Correct 149 ms 984 KB Output is correct
10 Correct 70 ms 980 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 31.0

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

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 980 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 2 ms 448 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 109 ms 984 KB Output is correct
9 Correct 149 ms 984 KB Output is correct
10 Correct 70 ms 980 KB Output is correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -