//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],say,visit[li],vv[li];
int cev;
string s;
vector<int> v[li];
vector<int> vect;
inline void dfs(int node){
//~ if(say==bb)return ;
if(say==bb)return ;
if(vis[node]==1 || visit[node]==1)return ;
vis[node]=1;
for(int i=0;i<(int)v[node].size();i++){
int go=v[node][i];
dfs(go);
}
//~ cout<<node<<endl;
say++;
if(say==bb)return ;
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
if(c<b)swap(c,b);
if(a<b)swap(a,b);
bb=b;
for(int i=0;i<(int)p.size();i++){
v[q[i]].pb(p[i]);
v[p[i]].pb(q[i]);
}
dfs(0);
for(int i=0;i<n;i++){
if(vis[i]==1){vv[i]=2;visit[i]=1;}
}
memset(vis,0,sizeof(vis));
say=0;
if(c<a)swap(c,a);
bb=a;
dfs(0);
for(int i=0;i<n;i++){
if(vis[i]==1){vv[i]=(1);}
else if(visit[i]==0)vv[i]=(3);
vect.pb(vv[i]);
}
return vect;
}
//~ int main(){
//~ vector<int>vec;
//~ vector<int>vec1;
//~ vector<int>vec2;
//~ vec.clear();
//~ vec1.clear();
//~ vec2.clear();
//~ vec1.pb(0);vec1.pb(0);vec1.pb(0);vec1.pb(0);
//~ vec2.pb(1);vec2.pb(2);vec2.pb(3);vec2.pb(4);
//~ vec=find_split(5,1,2,2,vec1,vec2);
//~ for(int i=0;i<(int)vec.size();i++){
//~ printf("%d\n",vec[i]);
//~ }
//~ return 0;
//~ }
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
15 ms |
14072 KB |
invalid split: #1=0, #2=2, #3=1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
15 ms |
14072 KB |
invalid split: #1=0, #2=3, #3=0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
18 ms |
14072 KB |
invalid split: #1=0, #2=2, #3=3 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
15 ms |
14040 KB |
invalid split: #1=0, #2=9, #3=0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
15 ms |
14072 KB |
invalid split: #1=0, #2=2, #3=1 |
2 |
Halted |
0 ms |
0 KB |
- |