| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 67914 |
2018-08-15T13:58:32 Z |
boook |
Game (IOI14_game) |
C++14 |
|
4 ms |
796 KB |
/*input
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define REP(i,j,k) for(int i = j ; i < k ; ++i)
#define RREP(i,j,k) for(int i = j ; i >=k ; --i)
#define A first
#define B second
#define mp make_pair
#define pb emplace_back
#define PII pair<int , int>
#define MEM(i,j) memset(i , j , sizeof i)
#define ALL(i) i.begin() , i.end()
#define DBGG(i,j) cout << i << " " << j << endl
#define DB4(i,j,k,l) cout << i << " " << j << " " << k << " " << l << endl
#define IOS cin.tie(0) , cout.sync_with_stdio(0)
// #define endl "\n"
///------------------------------------------------------------
#define MAX 1500
#define INF 0x3f3f3f3f
struct djs{
int x[MAX] , siz[MAX];
map<int , int> cc[MAX];
void init(){ REP(i , 0 , MAX) x[i] = i , siz[i] = 1; }
int Find(int a){ return a == x[a] ? a : x[a] = Find(x[a]); }
void Union(int a , int b){
a = Find(a) , b = Find(b);
if(a == b) return ;
cc[a].insert(cc[b].begin() , cc[b].end());
x[b] = a , siz[a] += siz[b];
}
int operator[](int a){ return Find(a); }
} ds;
int n;
void initialize(int _n){
n = _n;
ds.init();
}
int hasEdge(int a, int b){
a = ds[a];
b = ds[b];
int cnt = 0;
ds.cc[a][b] ++;
ds.cc[b][a] ++;
for(auto to : ds.cc[a]) if(ds[to.A] == b) cnt += to.B;
if(cnt == ds.siz[a] * ds.siz[b]) return ds.Union(a , b) , 1;
return 0;
}
// int main(){
// initialize(4);
// int a , b;
// while(cin >> a >> b){
// cout << hasEdge(a , b) << endl;
// }
// return 0;
// }
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
3 ms |
616 KB |
Output is correct |
| 3 |
Correct |
3 ms |
616 KB |
Output is correct |
| 4 |
Correct |
3 ms |
616 KB |
Output is correct |
| 5 |
Correct |
3 ms |
616 KB |
Output is correct |
| 6 |
Correct |
3 ms |
616 KB |
Output is correct |
| 7 |
Correct |
3 ms |
616 KB |
Output is correct |
| 8 |
Correct |
3 ms |
692 KB |
Output is correct |
| 9 |
Correct |
3 ms |
692 KB |
Output is correct |
| 10 |
Correct |
3 ms |
692 KB |
Output is correct |
| 11 |
Correct |
2 ms |
692 KB |
Output is correct |
| 12 |
Correct |
3 ms |
692 KB |
Output is correct |
| 13 |
Correct |
3 ms |
692 KB |
Output is correct |
| 14 |
Correct |
3 ms |
692 KB |
Output is correct |
| 15 |
Correct |
3 ms |
692 KB |
Output is correct |
| 16 |
Correct |
3 ms |
692 KB |
Output is correct |
| 17 |
Correct |
2 ms |
692 KB |
Output is correct |
| 18 |
Correct |
3 ms |
692 KB |
Output is correct |
| 19 |
Correct |
2 ms |
692 KB |
Output is correct |
| 20 |
Correct |
3 ms |
692 KB |
Output is correct |
| 21 |
Correct |
2 ms |
696 KB |
Output is correct |
| 22 |
Correct |
3 ms |
696 KB |
Output is correct |
| 23 |
Correct |
2 ms |
696 KB |
Output is correct |
| 24 |
Correct |
3 ms |
696 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
696 KB |
Output is correct |
| 2 |
Correct |
3 ms |
696 KB |
Output is correct |
| 3 |
Correct |
3 ms |
696 KB |
Output is correct |
| 4 |
Correct |
3 ms |
696 KB |
Output is correct |
| 5 |
Correct |
3 ms |
696 KB |
Output is correct |
| 6 |
Correct |
3 ms |
796 KB |
Output is correct |
| 7 |
Correct |
3 ms |
796 KB |
Output is correct |
| 8 |
Correct |
4 ms |
796 KB |
Output is correct |
| 9 |
Correct |
3 ms |
796 KB |
Output is correct |
| 10 |
Correct |
3 ms |
796 KB |
Output is correct |
| 11 |
Correct |
2 ms |
796 KB |
Output is correct |
| 12 |
Correct |
3 ms |
796 KB |
Output is correct |
| 13 |
Correct |
3 ms |
796 KB |
Output is correct |
| 14 |
Correct |
3 ms |
796 KB |
Output is correct |
| 15 |
Correct |
3 ms |
796 KB |
Output is correct |
| 16 |
Correct |
3 ms |
796 KB |
Output is correct |
| 17 |
Correct |
2 ms |
796 KB |
Output is correct |
| 18 |
Correct |
2 ms |
796 KB |
Output is correct |
| 19 |
Correct |
3 ms |
796 KB |
Output is correct |
| 20 |
Correct |
3 ms |
796 KB |
Output is correct |
| 21 |
Correct |
2 ms |
796 KB |
Output is correct |
| 22 |
Correct |
2 ms |
796 KB |
Output is correct |
| 23 |
Correct |
4 ms |
796 KB |
Output is correct |
| 24 |
Correct |
3 ms |
796 KB |
Output is correct |
| 25 |
Incorrect |
3 ms |
796 KB |
Output isn't correct |
| 26 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
796 KB |
Output is correct |
| 2 |
Correct |
3 ms |
796 KB |
Output is correct |
| 3 |
Correct |
2 ms |
796 KB |
Output is correct |
| 4 |
Correct |
3 ms |
796 KB |
Output is correct |
| 5 |
Correct |
2 ms |
796 KB |
Output is correct |
| 6 |
Correct |
3 ms |
796 KB |
Output is correct |
| 7 |
Correct |
3 ms |
796 KB |
Output is correct |
| 8 |
Correct |
3 ms |
796 KB |
Output is correct |
| 9 |
Correct |
3 ms |
796 KB |
Output is correct |
| 10 |
Correct |
2 ms |
796 KB |
Output is correct |
| 11 |
Correct |
3 ms |
796 KB |
Output is correct |
| 12 |
Correct |
2 ms |
796 KB |
Output is correct |
| 13 |
Correct |
3 ms |
796 KB |
Output is correct |
| 14 |
Correct |
2 ms |
796 KB |
Output is correct |
| 15 |
Correct |
3 ms |
796 KB |
Output is correct |
| 16 |
Correct |
2 ms |
796 KB |
Output is correct |
| 17 |
Correct |
2 ms |
796 KB |
Output is correct |
| 18 |
Correct |
3 ms |
796 KB |
Output is correct |
| 19 |
Correct |
3 ms |
796 KB |
Output is correct |
| 20 |
Correct |
2 ms |
796 KB |
Output is correct |
| 21 |
Correct |
3 ms |
796 KB |
Output is correct |
| 22 |
Correct |
2 ms |
796 KB |
Output is correct |
| 23 |
Correct |
2 ms |
796 KB |
Output is correct |
| 24 |
Correct |
2 ms |
796 KB |
Output is correct |
| 25 |
Incorrect |
3 ms |
796 KB |
Output isn't correct |
| 26 |
Halted |
0 ms |
0 KB |
- |
