Submission #111604

# Submission time Handle Problem Language Result Execution time Memory
111604 2019-05-15T16:33:22 Z CodeKracker Game (IOI14_game) C++14
100 / 100
441 ms 16504 KB
/*input

*/
/**
    Author: Kristopher Paul
    Date Created: 15-05-2019
    Contest Name:
                _/    _/   _/_/_/_/   _/   _/_/_/_/
               _/  _/     _/    _/   _/   _/
              _/_/       _/_/_/_/   _/   _/_/_/_/
             _/  _/     _/  _/     _/         _/
            _/    _/   _/    _/   _/   _/_/_/_/
**/
#include<bits/stdc++.h>
#define ll long long
//#define int ll
#define pb push_back
#define INF 0x3f3f3f3f //0x3f3f3f3f = 63
#define MOD 1000000009
#define mp make_pair
const double PI=3.141592653589793238462643383279502884197169399375105820974944;
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define umap unordered_map
#define pii pair<int,int>
#define F first
#define S second
#define mii map<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define itr :: iterator it
#define all(v) v.begin(),v.end()
#define WL(t) while(t--)
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
#define out(x) cout << #x << " is " << x << endl
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;

ll ModExp(ll x,ll y,ll m){
    ll res = 1;
    x = x % m;
    while (y > 0)
    {
        if (y & 1)
            res = (res*x) % m;

        y = y>>1;
        x = (x*x) % m;
    }
    return res;
}

void initialize(int n){

}

int tried[1505] = {};

int hasEdge(int u, int v){
    if(u < v){
        swap(u,v);
    }
    tried[u]++;
    if(tried[u] == u){
        return 1;
    }
    return 0;
}
/*
void solve(){
    int n;
    cin >> n;
    initialize(n);
    FOR(i,0,(n*(n-1))/2){
        int u,v;
        cin >> u >> v;
        cout << hasEdge(u,v) << endl;
    }
    system("pause");
}

signed main(){
    FastIO;
    int t = 1;
//    cin >> t;
    WL(t){
        solve();
    }
}*/
# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 3 ms 384 KB Output is correct
35 Correct 4 ms 384 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 4 ms 384 KB Output is correct
38 Correct 3 ms 384 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 3 ms 384 KB Output is correct
41 Correct 3 ms 384 KB Output is correct
42 Correct 3 ms 384 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 4 ms 384 KB Output is correct
45 Correct 4 ms 384 KB Output is correct
46 Correct 4 ms 384 KB Output is correct
47 Correct 4 ms 384 KB Output is correct
48 Correct 4 ms 384 KB Output is correct
49 Correct 4 ms 512 KB Output is correct
50 Correct 4 ms 384 KB Output is correct
51 Correct 8 ms 384 KB Output is correct
52 Correct 3 ms 384 KB Output is correct
53 Correct 4 ms 384 KB Output is correct
54 Correct 4 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 284 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 484 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 3 ms 256 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 3 ms 384 KB Output is correct
35 Correct 3 ms 384 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 4 ms 384 KB Output is correct
38 Correct 3 ms 384 KB Output is correct
39 Correct 4 ms 384 KB Output is correct
40 Correct 4 ms 384 KB Output is correct
41 Correct 4 ms 384 KB Output is correct
42 Correct 3 ms 384 KB Output is correct
43 Correct 4 ms 384 KB Output is correct
44 Correct 4 ms 384 KB Output is correct
45 Correct 3 ms 384 KB Output is correct
46 Correct 3 ms 384 KB Output is correct
47 Correct 3 ms 428 KB Output is correct
48 Correct 3 ms 384 KB Output is correct
49 Correct 3 ms 384 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 3 ms 384 KB Output is correct
52 Correct 3 ms 384 KB Output is correct
53 Correct 7 ms 512 KB Output is correct
54 Correct 3 ms 384 KB Output is correct
55 Correct 36 ms 2080 KB Output is correct
56 Correct 37 ms 2168 KB Output is correct
57 Correct 38 ms 2168 KB Output is correct
58 Correct 35 ms 2040 KB Output is correct
59 Correct 38 ms 2040 KB Output is correct
60 Correct 47 ms 2168 KB Output is correct
61 Correct 42 ms 2168 KB Output is correct
62 Correct 41 ms 2168 KB Output is correct
63 Correct 44 ms 2168 KB Output is correct
64 Correct 40 ms 2040 KB Output is correct
65 Correct 47 ms 2168 KB Output is correct
66 Correct 41 ms 2040 KB Output is correct
67 Correct 44 ms 2140 KB Output is correct
68 Correct 47 ms 2172 KB Output is correct
69 Correct 44 ms 2084 KB Output is correct
70 Correct 35 ms 2064 KB Output is correct
71 Correct 51 ms 2040 KB Output is correct
72 Correct 41 ms 2016 KB Output is correct
73 Correct 38 ms 2084 KB Output is correct
74 Correct 36 ms 2168 KB Output is correct
75 Correct 37 ms 2040 KB Output is correct
76 Correct 104 ms 4316 KB Output is correct
77 Correct 79 ms 4344 KB Output is correct
78 Correct 98 ms 4344 KB Output is correct
79 Correct 85 ms 4344 KB Output is correct
80 Correct 103 ms 4344 KB Output is correct
81 Correct 101 ms 4344 KB Output is correct
82 Correct 103 ms 4400 KB Output is correct
83 Correct 99 ms 4548 KB Output is correct
84 Correct 102 ms 4344 KB Output is correct
85 Correct 249 ms 7516 KB Output is correct
86 Correct 166 ms 7544 KB Output is correct
87 Correct 176 ms 7416 KB Output is correct
88 Correct 150 ms 7416 KB Output is correct
89 Correct 142 ms 7472 KB Output is correct
90 Correct 170 ms 7568 KB Output is correct
91 Correct 162 ms 7484 KB Output is correct
92 Correct 152 ms 7544 KB Output is correct
93 Correct 180 ms 7416 KB Output is correct
94 Correct 377 ms 16340 KB Output is correct
95 Correct 441 ms 16504 KB Output is correct
96 Correct 339 ms 16420 KB Output is correct
97 Correct 413 ms 16284 KB Output is correct
98 Correct 373 ms 16316 KB Output is correct
99 Correct 323 ms 16376 KB Output is correct
100 Correct 318 ms 16444 KB Output is correct