oj.uz

Submission #1109634

# Submission time Handle Problem Language Result Execution time Memory
1109634 2024-11-07T08:04:10 Z theSkeleton Toll (BOI17_toll) C++17
0 / 100
 46 ms 36936 KB 
//!!in the name of god!!
#include<bits/stdc++.h>
#define space <<' '<<
#define endl '\n'
#define inf 1e9
#define F first
#define S second
#define PB push_back
#define PF push_front
#define pll pair<ll,ll>
#define pii pair<int,int>
#define md(a) ((a+mod)%mod)
#define MP(a,b) make_pair(a,b)
#define all(a) a.begin(),a.end()
#define MT(a,b,c) make_tuple(a,b,c)
typedef long long ll;
using namespace std;
template<typename t> using heap=
priority_queue<t,vector<t>,greater<t>>;
const int mx = 5e4+5;
const int lg = 27;
vector<pll> adj[mx][lg];
int glg(int v){
    if(v<2)return 0;
    return glg(v/2)+1;
}
int has(vector<pll>& q,int s){
    for(int t=0;t<q.size();t++)
        if(q[t].F==s)return t;
    return -1;
}
int main(){
    std::ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int k,n,m,o;
    cin>>k>>n>>m>>o;
    for(int u,v,t;m--;)
        cin>>u>>v>>t,
        adj[u][0].PB(MP(v,t));
    for(int v=0;v<n;v++)
    for(int p=1;p<lg;p++)
    for(auto e:adj[v][p-1])
    for(auto d:adj[e.F][p-1]){
        int c=has(adj[v][p],d.F);
        if(c!=-1)adj[v][p][c]
        =min(adj[v][p][c],MP(d.F,e.S+d.S));
        else adj[v][p].PB(MP(d.F,e.S+d.S));
    }
    for(int a,b;o--;){
        cin>>a>>b;
        int c=a/k,e=b/k;
        vector<pll> cu,te;
        cu.PB(MP(a,0));
        while(c<e){
            te.clear();
            int p=glg(e-c);
            for(auto e:cu)
            for(auto d:adj[e.F][p]){
                int t=has(te,d.F);
                if(t!=-1)te[t]=min(te[t],MP(d.F,e.S+d.S));
                else               te.PB(MP(d.F,e.S+d.S));
            }
            c+=1<<p;
            cu=te;
        }
        int t=has(cu,b);
        if(t==-1) cout<<-1<<endl;
        else cout<<cu[t].S<<endl;
    }
}

Compilation message

toll.cpp: In function 'int has(std::vector<std::pair<long long int, long long int> >&, int)':
toll.cpp:28:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for(int t=0;t<q.size();t++)
      |                 ~^~~~~~~~~

Subtask #1
0 / 7.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 32080 KB Output is correct
2 Correct 9 ms 32080 KB Output is correct
3 Correct 8 ms 32080 KB Output is correct
4 Correct 7 ms 32080 KB Output is correct
5 Correct 7 ms 32080 KB Output is correct
6 Incorrect 8 ms 32220 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 32080 KB Output is correct
2 Correct 9 ms 32080 KB Output is correct
3 Correct 8 ms 32080 KB Output is correct
4 Correct 7 ms 32080 KB Output is correct
5 Correct 7 ms 32080 KB Output is correct
6 Incorrect 8 ms 32220 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

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