oj.uz

Submission #405663

# Submission time Handle Problem Language Result Execution time Memory
405663 2021-05-16T16:34:01 Z Blistering_Barnacles Swapping Cities (APIO20_swap) C++11
6 / 100
 135 ms 26420 KB 
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include "swap.h"
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
pll tree[555555] ;
    bool is = 1 ;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    for(ll i = 0 ; i < M ; i++){
        adj[U[i]].pb(V[i]) , adj[V[i]].pb(U[i]);
        k = max(k , W[i]) ;
    }
    for(ll i = 0 ; i < N ; i++){
        is &= (sz(adj[i]) == 2) ;
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    R (is ? k : -1) ;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 13260 KB Output is correct
2 Correct 8 ms 13240 KB Output is correct
3 Correct 8 ms 13284 KB Output is correct
4 Correct 8 ms 13300 KB Output is correct
5 Correct 9 ms 13352 KB Output is correct
6 Correct 10 ms 13388 KB Output is correct
7 Correct 8 ms 13364 KB Output is correct
8 Correct 9 ms 13428 KB Output is correct
9 Correct 51 ms 19244 KB Output is correct
10 Correct 64 ms 20592 KB Output is correct
11 Correct 63 ms 20476 KB Output is correct
12 Correct 63 ms 20900 KB Output is correct
13 Correct 61 ms 20932 KB Output is correct
14 Correct 57 ms 19636 KB Output is correct
15 Correct 126 ms 24716 KB Output is correct
16 Correct 124 ms 24604 KB Output is correct
17 Correct 126 ms 24980 KB Output is correct
18 Correct 124 ms 24964 KB Output is correct
19 Correct 69 ms 19644 KB Output is correct
20 Correct 127 ms 25796 KB Output is correct
21 Correct 131 ms 26000 KB Output is correct
22 Correct 135 ms 26368 KB Output is correct
23 Correct 131 ms 26420 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 13260 KB Output is correct
2 Correct 8 ms 13240 KB Output is correct
3 Incorrect 111 ms 24404 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 13260 KB Output is correct
2 Correct 8 ms 13240 KB Output is correct
3 Correct 8 ms 13284 KB Output is correct
4 Correct 8 ms 13300 KB Output is correct
5 Correct 9 ms 13352 KB Output is correct
6 Correct 10 ms 13388 KB Output is correct
7 Correct 8 ms 13364 KB Output is correct
8 Correct 9 ms 13428 KB Output is correct
9 Incorrect 8 ms 13352 KB Output isn't correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 13352 KB Output isn't correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 13260 KB Output is correct
2 Correct 8 ms 13240 KB Output is correct
3 Correct 8 ms 13284 KB Output is correct
4 Correct 8 ms 13300 KB Output is correct
5 Correct 9 ms 13352 KB Output is correct
6 Correct 10 ms 13388 KB Output is correct
7 Correct 8 ms 13364 KB Output is correct
8 Correct 9 ms 13428 KB Output is correct
9 Correct 51 ms 19244 KB Output is correct
10 Correct 64 ms 20592 KB Output is correct
11 Correct 63 ms 20476 KB Output is correct
12 Correct 63 ms 20900 KB Output is correct
13 Correct 61 ms 20932 KB Output is correct
14 Correct 57 ms 19636 KB Output is correct
15 Correct 126 ms 24716 KB Output is correct
16 Correct 124 ms 24604 KB Output is correct
17 Correct 126 ms 24980 KB Output is correct
18 Correct 124 ms 24964 KB Output is correct
19 Incorrect 111 ms 24404 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 13352 KB Output isn't correct