#include "Alicelib.h"
#include <bits/stdc++.h>
using namespace std ;
void Alice(int n, int m, int a[], int b[] )
{
vector< pair<int , int> >vp ;
for(int i = 0 ; i < m ; ++i)
vp.emplace_back(a[i] , b[i]) ;
for(int bit = 0 ; bit < 10 ; ++bit)
{
for(int i = 0 ; i < n ; ++i)
{
if((i & (1 << bit)))
vp.emplace_back(i , n+bit) ;
}
}
for(int i = 0 ; i < n ; ++i)
vp.emplace_back(i , n+10) ;
for(int i = 0 ; i < n+10 ; ++i)
vp.emplace_back(i , n+11) ;
InitG(n+12 , vp.size()) ;
int idx = 0 ;
for(auto &p : vp)
MakeG(idx , p.first , p.second) , ++idx ;
}
#include "Boblib.h"
#include <bits/stdc++.h>
using namespace std ;
const int MAX = 2004 ;
int deg[MAX] , taken[MAX] , mark[MAX] ;
int val[MAX] ;
vector< vector<int> >adj(MAX) ;
void Bob( int V, int U, int C[], int D[] )
{
int n = V-12 ;
for(int i = 0 ; i < U ; ++i)
{
adj[C[i]].push_back(D[i]) ;
adj[D[i]].push_back(C[i]) ;
deg[C[i]]++ , deg[D[i]]++ ;
}
int last = -1 ;
for(int i = 0 ; i < V ; ++i)
{
if(deg[i] == n+10)
last = i ;
}
for(auto &node : adj[last])
taken[node] = 1 ;
int now ;
for(int i = 0 ; i < V ; ++i)
{
if((!taken[i]) && i != last)
{
now = i ;
break ;
}
}
assert(deg[now] == n) ;
for(auto &node : adj[now])
mark[node] = 1 ;
vector< pair<int , int> >bits ;
for(int i = 0 ; i < V ; ++i)
{
if((!mark[i]) && i != now && i != last)
bits.emplace_back(deg[i] , i) ;
}
sort(bits.begin() , bits.end()) ;
reverse(bits.begin() , bits.end()) ;
for(int i = 0 ; i < 10 ; ++i)
{
for(auto &node : adj[bits[i].second])
val[node] |= (1 << i) ;
}
vector< pair<int , int> >ans ;
for(int i = 0 ; i < U ; ++i)
{
int x = C[i] , y = D[i] ;
if(mark[x] && mark[y])
ans.emplace_back(val[x] , val[y]) ;
}
InitMap(n , ans.size()) ;
for(auto &p : ans)
MakeMap(p.first , p.second) ;
}
Compilation message
Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:45:17: warning: 'now' may be used uninitialized in this function [-Wmaybe-uninitialized]
45 | if((!mark[i]) && i != now && i != last)
| ~~~~~~~~~~~^~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
4644 KB |
Output is correct |
2 |
Failed |
2 ms |
4612 KB |
Wrong Answer [13] |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
4644 KB |
Output is correct |
2 |
Failed |
2 ms |
4612 KB |
Wrong Answer [13] |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
459 ms |
34928 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |