//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include "split.h"
using namespace std;
typedef long long lo;
typedef pair< int,int > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int m,bb,k,flag,t,vis[li];
int cev;
string s;
vector<int> v[li];
vector<int> vv;
inline void dfs(int node,int der){
if(vis[node]==1)return ;
if(der==bb)return ;
vis[node]=1;
for(int i=0;i<(int)v[node].size();i++){
int go=v[node][i];
dfs(go,der+1);
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
bb=b;
for(int i=0;i<(int)p.size();i++){
v[q[i]].pb(p[i]);
v[p[i]].pb(q[i]);
}
dfs(1,0);
for(int i=0;i<n;i++){
if(vis[i]==1){vv.pb(2);}
else if(flag==0){flag=1;vv.pb(1);}
else vv.pb(3);
}
return vv;
}
//~ int main(){
//~ return 0;
//~ }
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
12024 KB |
ok, correct split |
2 |
Correct |
13 ms |
12024 KB |
ok, correct split |
3 |
Correct |
13 ms |
12024 KB |
ok, correct split |
4 |
Incorrect |
13 ms |
12024 KB |
invalid split: #1=1, #2=1, #3=2 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
12024 KB |
ok, correct split |
2 |
Correct |
13 ms |
12024 KB |
ok, correct split |
3 |
Incorrect |
13 ms |
12024 KB |
invalid split: #1=1, #2=3, #3=1 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
13 ms |
12024 KB |
invalid split: #1=1, #2=1, #3=3 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
13 ms |
12068 KB |
invalid split: #1=1, #2=3, #3=5 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
12024 KB |
ok, correct split |
2 |
Correct |
13 ms |
12024 KB |
ok, correct split |
3 |
Correct |
13 ms |
12024 KB |
ok, correct split |
4 |
Incorrect |
13 ms |
12024 KB |
invalid split: #1=1, #2=1, #3=2 |
5 |
Halted |
0 ms |
0 KB |
- |