oj.uz

Submission #387704

# Submission time Handle Problem Language Result Execution time Memory
387704 2021-04-09T05:55:59 Z RohamIzadidoost Swapping Cities (APIO20_swap) C++14
0 / 100
 2000 ms 11680 KB 
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
#define pll pair<ll , ll >
#define all(x) (x).begin(),(x).end()
#define SZ(x) (ll)(x).size()
#define X   first
#define Y   second
#define mp  make_pair
#define pii pair<int , int>
#define vec vector
#define file_io freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define migmig ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
// BIG p : 1000000000000037 , 100000000003
ll poww(ll a, ll b, ll md) {
    return (!b ? 1 : (b & 1 ? a * poww(a * a % md, b / 2, md) % md : poww(a * a % md, b / 2, md) % md));
}
const int maxn = 2000*100+5 ;
const ll inf = 9223372036854775807 ;
const ll mod = 1e9 + 7 ;
const int lg = 20 ;
int par[maxn] , sz[maxn] , mark[maxn] , d[maxn]  , flag , ans ;
vec<pair<int , pii>> e ;
void prep(){
	for(int i = 0 ; i < maxn ; i ++ ){
		par[i] = i ; 
		sz[i] = 1 ; 
		mark[i] = d[i] = 0 ; 
	}
}
int getpar(int v){
	return v == par[v] ? v : par[v] = getpar(par[v]) ;
} 
void merge(int x , int y){
	d[x] ++  , d[y] ++ ; 
	flag = 0 ; if(d[x] >= 3 || d[y] >= 3) flag = 1 ; 
	x = getpar(x) , y = getpar(y) ; 
	if(x == y){
		mark[x] = 1 ; 
		return ; 
	}
	if(sz[x] < sz[y]) swap(x , y) ; 
	par[y] = x ; 
	sz[x] += sz[y] ; 
	mark[x] |= flag ; 
}
int getMinimumFuelCapacity(int x , int y){
	prep() ;
	for(auto u : e){
		merge(u.Y.X , u.Y.Y) ; 
		ans = u.X ; 
		if(getpar(x) == getpar(y) && mark[getpar(x)]){
			return ans ; 
		}
	}
	return -1 ; 
}
void init(int n , int m , vec<int> A , vec<int> B , vec<int> W ){
	for(int i = 0 ; i < m ; i ++ ){
		e.pb({W[i] , {A[i] , B[i]}}) ; 
	}
	sort(all(e)) ;
}
/*int main()
{
	migmig ;
	int n , m  ; 
	cin>>n>>m ; 
	int u[m] , v[m] , w[m] ;
	for(int i = 0 ; i < m ; i ++ ) cin>>u[i]>>v[i]>>w[i] ; 
	init(n , m , u , v , w) ;
	int q ; 
	cin>>q ; 
	while(q--){
		int U , V ; 
		cin>>U>>V ; 
		cout<<getMinimumFuelCapacity(U , V) << endl ; 
	}
}*/

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3536 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Correct 3 ms 3404 KB Output is correct
4 Correct 3 ms 3388 KB Output is correct
5 Correct 3 ms 3404 KB Output is correct
6 Correct 3 ms 3404 KB Output is correct
7 Correct 3 ms 3404 KB Output is correct
8 Correct 3 ms 3404 KB Output is correct
9 Correct 45 ms 7056 KB Output is correct
10 Correct 61 ms 7840 KB Output is correct
11 Correct 65 ms 7708 KB Output is correct
12 Correct 71 ms 8100 KB Output is correct
13 Correct 68 ms 7972 KB Output is correct
14 Execution timed out 2089 ms 7308 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3536 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Execution timed out 2060 ms 11680 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

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

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 2 ms 3536 KB Output is correct
3 Correct 2 ms 3404 KB Output is correct
4 Correct 3 ms 3404 KB Output is correct
5 Correct 3 ms 3388 KB Output is correct
6 Correct 3 ms 3404 KB Output is correct
7 Correct 3 ms 3404 KB Output is correct
8 Correct 3 ms 3404 KB Output is correct
9 Correct 3 ms 3404 KB Output is correct
10 Correct 45 ms 7056 KB Output is correct
11 Correct 61 ms 7840 KB Output is correct
12 Correct 65 ms 7708 KB Output is correct
13 Correct 71 ms 8100 KB Output is correct
14 Correct 68 ms 7972 KB Output is correct
15 Correct 3 ms 3396 KB Output is correct
16 Incorrect 3 ms 3404 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3536 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Correct 3 ms 3404 KB Output is correct
4 Correct 3 ms 3388 KB Output is correct
5 Correct 3 ms 3404 KB Output is correct
6 Correct 3 ms 3404 KB Output is correct
7 Correct 3 ms 3404 KB Output is correct
8 Correct 3 ms 3404 KB Output is correct
9 Correct 45 ms 7056 KB Output is correct
10 Correct 61 ms 7840 KB Output is correct
11 Correct 65 ms 7708 KB Output is correct
12 Correct 71 ms 8100 KB Output is correct
13 Correct 68 ms 7972 KB Output is correct
14 Execution timed out 2089 ms 7308 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 2 ms 3536 KB Output is correct
3 Correct 2 ms 3404 KB Output is correct
4 Correct 3 ms 3404 KB Output is correct
5 Correct 3 ms 3388 KB Output is correct
6 Correct 3 ms 3404 KB Output is correct
7 Correct 3 ms 3404 KB Output is correct
8 Correct 3 ms 3404 KB Output is correct
9 Correct 3 ms 3404 KB Output is correct
10 Correct 45 ms 7056 KB Output is correct
11 Correct 61 ms 7840 KB Output is correct
12 Correct 65 ms 7708 KB Output is correct
13 Correct 71 ms 8100 KB Output is correct
14 Correct 68 ms 7972 KB Output is correct
15 Execution timed out 2089 ms 7308 KB Time limit exceeded
16 Halted 0 ms 0 KB -