oj.uz

Submission #739666

# Submission time Handle Problem Language Result Execution time Memory
739666 2023-05-11T00:48:50 Z chenyan Swapping Cities (APIO20_swap) C++17
6 / 100
 96 ms 18168 KB 
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define ld long double
#define pii pair<int,int>
#define pdd pair<ld,ld>
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define fastio ios::sync_with_stdio(0),cin.tie(0);
#define nl '\n'
#define mN 200010
int n,m,ans;
vector<pii>g[mN];
void init(int N,int M,vector<int>u,vector<int>v,vector<int>w){
	n=N,m=M;	
	for(int i=0;i<m;i++){
		ans=max(ans,w[i]);
		g[u[i]].pb({v[i],w[i]});
		g[v[i]].pb({u[i],w[i]});
	}
	for(int i=0;i<n;i++){
		if(sz(g[i])!=2)ans=-1;
	}
}
int getMinimumFuelCapacity(int x,int y){
	return ans;
}
/*
signed main(){
	fastio;
}
*/

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 35 ms 9292 KB Output is correct
10 Correct 42 ms 10224 KB Output is correct
11 Correct 41 ms 10088 KB Output is correct
12 Correct 43 ms 10416 KB Output is correct
13 Correct 43 ms 10444 KB Output is correct
14 Correct 38 ms 9384 KB Output is correct
15 Correct 91 ms 12064 KB Output is correct
16 Correct 87 ms 11900 KB Output is correct
17 Correct 91 ms 12192 KB Output is correct
18 Correct 90 ms 12192 KB Output is correct
19 Correct 45 ms 9300 KB Output is correct
20 Correct 88 ms 17388 KB Output is correct
21 Correct 96 ms 17528 KB Output is correct
22 Correct 92 ms 18020 KB Output is correct
23 Correct 96 ms 18168 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 17.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 35 ms 9292 KB Output is correct
10 Correct 42 ms 10224 KB Output is correct
11 Correct 41 ms 10088 KB Output is correct
12 Correct 43 ms 10416 KB Output is correct
13 Correct 43 ms 10444 KB Output is correct
14 Correct 38 ms 9384 KB Output is correct
15 Correct 91 ms 12064 KB Output is correct
16 Correct 87 ms 11900 KB Output is correct
17 Correct 91 ms 12192 KB Output is correct
18 Correct 90 ms 12192 KB Output is correct
19 Incorrect 85 ms 12612 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

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