#include "split.h"
#include <bits/stdc++.h>
using namespace std;
vector< vector< int > > Graph;
vector< int > colouring;
vector< bool > visited;
int remaining;
void dfs(int node){
visited[node] = true;
if(remaining--) colouring[node] = 2;
for(int a : Graph[node]){
if(visited[a]) continue;
dfs(a);
}
}
vector<int> find_split(int N, int a, int b, int c, vector<int> p, vector<int> q) {
Graph.resize(N);
colouring.resize(N);
visited.assign(N, false);
remaining = b;
for(int i = 0; i < N; i++){
Graph[p[i]].push_back(q[i]);
Graph[q[i]].push_back(p[i]);
}
dfs(0);
for(int i = 0; i < N; i++){
if(a--) colouring[i] = 1;
else colouring[i] = 3;
}
return colouring;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
3 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
376 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
invalid split: #1=8, #2=0, #3=1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
3 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |