oj.uz

Submission #527504

# Submission time Handle Problem Language Result Execution time Memory
527504 2022-02-17T13:53:26 Z zaneyu Autobus (COCI22_autobus) C++14
70 / 70
 151 ms 1980 KB 
/*input
4 7
1 2 1
1 4 10
2 3 1
2 4 5
3 2 2
3 4 1
4 3 2
3 3
1 4
4 2
3 3
*/
#include<bits/stdc++.h>
using namespace std;
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
#define ll long long
#define ld long double
#define pii pair<ld,ld>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=70+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1.0);
const ld eps=1e-8;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<(V[i])<<((i!=sz(V)-1)?" ":"\n");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}	
int dist[maxn][maxn][maxn];
int32_t main(){
	ios::sync_with_stdio(false),cin.tie(0); 
	int n,m;
	cin>>n>>m;
	REP(i,n+1) REP(a,n) REP(b,n) dist[i][a][b]=INF;
	REP(i,n) dist[0][i][i]=0;
	REP(i,m){
		int a,b,c;
		cin>>a>>b>>c;
		--a,--b;
		MNTO(dist[1][a][b],c);
	}
	int K,q;
	cin>>K>>q;
	MNTO(K,n-1);
	REP1(x,K){
		REP(k,n){
			REP(a,n){
				REP(b,n){
					MNTO(dist[x][a][b],dist[x-1][a][k]+dist[1][k][b]);
				}
			}
		}
		
	}
	while(q--){
		int a,b;
		cin>>a>>b;
		--a,--b;
		int ans=dist[K][a][b];
		REP(j,K+1) MNTO(ans,dist[j][a][b]);
		if(ans==INF) ans=-1;
		cout<<ans<<'\n';
	}
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB Output is correct
2 Correct 3 ms 1868 KB Output is correct
3 Correct 3 ms 1868 KB Output is correct
4 Correct 3 ms 1868 KB Output is correct
5 Correct 4 ms 1868 KB Output is correct
6 Correct 4 ms 1868 KB Output is correct
7 Correct 4 ms 1868 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 10 ms 1868 KB Output is correct
8 Correct 24 ms 1868 KB Output is correct
9 Correct 3 ms 1868 KB Output is correct
10 Correct 15 ms 1868 KB Output is correct
11 Correct 6 ms 1868 KB Output is correct
12 Correct 22 ms 1876 KB Output is correct
13 Correct 97 ms 1868 KB Output is correct
14 Correct 112 ms 1868 KB Output is correct
15 Correct 108 ms 1868 KB Output is correct
16 Correct 88 ms 1872 KB Output is correct
17 Correct 86 ms 1872 KB Output is correct
18 Correct 91 ms 1868 KB Output is correct
19 Correct 124 ms 1868 KB Output is correct
20 Correct 96 ms 1868 KB Output is correct
21 Correct 85 ms 1868 KB Output is correct
22 Correct 87 ms 1868 KB Output is correct
23 Correct 90 ms 1868 KB Output is correct
24 Correct 103 ms 1868 KB Output is correct
25 Correct 99 ms 1864 KB Output is correct
26 Correct 93 ms 1876 KB Output is correct
27 Correct 94 ms 1868 KB Output is correct
28 Correct 92 ms 1868 KB Output is correct
29 Correct 98 ms 1868 KB Output is correct
30 Correct 87 ms 1868 KB Output is correct
31 Correct 95 ms 1872 KB Output is correct
32 Correct 126 ms 1868 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 2 ms 1868 KB Output is correct
8 Correct 3 ms 1868 KB Output is correct
9 Correct 3 ms 1868 KB Output is correct
10 Correct 3 ms 1868 KB Output is correct
11 Correct 4 ms 1868 KB Output is correct
12 Correct 4 ms 1868 KB Output is correct
13 Correct 4 ms 1868 KB Output is correct
14 Correct 10 ms 1868 KB Output is correct
15 Correct 24 ms 1868 KB Output is correct
16 Correct 3 ms 1868 KB Output is correct
17 Correct 15 ms 1868 KB Output is correct
18 Correct 6 ms 1868 KB Output is correct
19 Correct 22 ms 1876 KB Output is correct
20 Correct 97 ms 1868 KB Output is correct
21 Correct 112 ms 1868 KB Output is correct
22 Correct 108 ms 1868 KB Output is correct
23 Correct 88 ms 1872 KB Output is correct
24 Correct 86 ms 1872 KB Output is correct
25 Correct 91 ms 1868 KB Output is correct
26 Correct 124 ms 1868 KB Output is correct
27 Correct 96 ms 1868 KB Output is correct
28 Correct 85 ms 1868 KB Output is correct
29 Correct 87 ms 1868 KB Output is correct
30 Correct 90 ms 1868 KB Output is correct
31 Correct 103 ms 1868 KB Output is correct
32 Correct 99 ms 1864 KB Output is correct
33 Correct 93 ms 1876 KB Output is correct
34 Correct 94 ms 1868 KB Output is correct
35 Correct 92 ms 1868 KB Output is correct
36 Correct 98 ms 1868 KB Output is correct
37 Correct 87 ms 1868 KB Output is correct
38 Correct 95 ms 1872 KB Output is correct
39 Correct 126 ms 1868 KB Output is correct
40 Correct 9 ms 1860 KB Output is correct
41 Correct 26 ms 1980 KB Output is correct
42 Correct 5 ms 1868 KB Output is correct
43 Correct 33 ms 1880 KB Output is correct
44 Correct 6 ms 1872 KB Output is correct
45 Correct 27 ms 1868 KB Output is correct
46 Correct 87 ms 1868 KB Output is correct
47 Correct 101 ms 1876 KB Output is correct
48 Correct 88 ms 1868 KB Output is correct
49 Correct 111 ms 1868 KB Output is correct
50 Correct 86 ms 1880 KB Output is correct
51 Correct 95 ms 1868 KB Output is correct
52 Correct 86 ms 1868 KB Output is correct
53 Correct 109 ms 1864 KB Output is correct
54 Correct 84 ms 1852 KB Output is correct
55 Correct 95 ms 1868 KB Output is correct
56 Correct 147 ms 1868 KB Output is correct
57 Correct 119 ms 1868 KB Output is correct
58 Correct 85 ms 1868 KB Output is correct
59 Correct 94 ms 1868 KB Output is correct
60 Correct 103 ms 1876 KB Output is correct
61 Correct 151 ms 1880 KB Output is correct
62 Correct 84 ms 1848 KB Output is correct
63 Correct 87 ms 1868 KB Output is correct
64 Correct 88 ms 1868 KB Output is correct
65 Correct 120 ms 1868 KB Output is correct