#include <vector>
#include <set>
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
vector<int>g;
int const N=110;
vector<int>chi[N]={};int par[N]={};
bool w=0;
bool q(vector<int>x,vector<int>y)
{
vector<int>a,b;
for (auto i:x)
for (auto j:chi[i])
a.push_back(j);
for (auto i:y)
for (auto j:chi[i])
b.push_back(j);
int* c=new int[a.size()];int *d=new int[b.size()];
for (int i=0;i<a.size();i++)
c[i]=a[i];
for (int i=0;i<b.size();i++)
d[i]=b[i];
int z=query(a.size(),b.size(),c,d);
return z;
}
bool q1(vector<int>a,vector<int>b)
{
int* c=new int[a.size()];int *d=new int[b.size()];
for (int i=0;i<a.size();i++)
c[i]=a[i];
for (int i=0;i<b.size();i++)
d[i]=b[i];
int z=query(a.size(),b.size(),c,d);
return z;
}
bool check(int l,int r)
{
int mid=(l+r)/2;
vector<int>a,b;
for (int i=l;i<=mid;i++)
a.push_back(g[i]);
for (int i=mid+1;i<=r;i++)
b.push_back(g[i]);
return q(a,b);
}
int root(int x)
{
if (x==par[x])
return x;
return (par[x]=root(par[x]));
}
void merge1(int x,int y)
{
x=root(x);
y=root(y);
for (auto i:chi[y])
chi[x].push_back(i);
chi[y]={};
par[y]=x;
}
int DnC2(vector<int>a,vector<int>b)
{
if (q1(a,b)==0)
return -1;
if (a.size()==1)
return a[0];
shuffle(a.begin(), a.end(),RNG);
vector<int>x,y;
int z=(a.size())/2;
for (int i=0;i<z;i++)
x.push_back(a[i]);
for (int i=z;i<a.size();i++)
y.push_back(a[i]);
z=DnC2(x,b);
if (z==-1)
return DnC2(y,b);
return z;
}
int DnC1(vector<int>a,vector<int>b)
{
if (q(a,b)==0)
return -1;
if (a.size()==1)
return a[0];
vector<int>x,y;
shuffle(a.begin(), a.end(),RNG);
int z=(a.size())/2;
for (int i=0;i<z;i++)
x.push_back(a[i]);
for (int i=z;i<a.size();i++)
y.push_back(a[i]);
z=DnC1(x,b);
if (z==-1)
return DnC1(y,b);
return z;
}
void cq1(int r,int l)
{
vector<int>a,b;
for (auto i:chi[r])
a.push_back(i);
for (auto i:chi[l])
b.push_back(i);
int x=DnC2(a,b);
int y=DnC2(b,{x});
setRoad(x,y);merge1(x,y);
}
void cq(int l,int r)
{
int mid=(l+r)/2;
vector<int>a,b;
for (int i=l;i<=mid;i++)
a.push_back(g[i]);
for (int i=mid+1;i<=r;i++)
b.push_back(g[i]);
int z=DnC1(a,b);
int y=DnC1(b,{z});
cq1(z,y);
}
void DnC(int l,int r)
{
if (r-l+1==1)
return;
shuffle(g.begin()+l, g.begin()+r,RNG);
if (!w)
{
if (check(l,r))
{
w=1;
cq(l,r);
}
}
int mid=(l+r)/2;
DnC(l,mid);
DnC(mid+1,r);
}
void run(int n)
{
for (int i=1;i<=n;i++)
{
par[i]=i;
g.push_back(i);
chi[i].push_back(i);
}
for (int i=0;i<n-1;i++)
{
w=0;
DnC(0,g.size()-1);
}
}
Compilation message
icc.cpp: In function 'bool q(std::vector<int>, std::vector<int>)':
icc.cpp:21:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
21 | for (int i=0;i<a.size();i++)
| ~^~~~~~~~~
icc.cpp:23:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
23 | for (int i=0;i<b.size();i++)
| ~^~~~~~~~~
icc.cpp: In function 'bool q1(std::vector<int>, std::vector<int>)':
icc.cpp:31:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
31 | for (int i=0;i<a.size();i++)
| ~^~~~~~~~~
icc.cpp:33:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
33 | for (int i=0;i<b.size();i++)
| ~^~~~~~~~~
icc.cpp: In function 'int DnC2(std::vector<int>, std::vector<int>)':
icc.cpp:74:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
74 | for (int i=z;i<a.size();i++)
| ~^~~~~~~~~
icc.cpp: In function 'int DnC1(std::vector<int>, std::vector<int>)':
icc.cpp:92:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
92 | for (int i=z;i<a.size();i++)
| ~^~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
9 ms |
604 KB |
Ok! 282 queries used. |
| 2 |
Correct |
9 ms |
644 KB |
Ok! 273 queries used. |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
59 ms |
856 KB |
Ok! 1738 queries used. |
| 2 |
Incorrect |
67 ms |
804 KB |
Too many queries! 2609 out of 2500 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
189 ms |
848 KB |
Number of queries more than 4500 out of 2250 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
174 ms |
1228 KB |
Number of queries more than 4000 out of 2000 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
147 ms |
652 KB |
Number of queries more than 3550 out of 1775 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
135 ms |
740 KB |
Number of queries more than 3250 out of 1625 |
| 2 |
Halted |
0 ms |
0 KB |
- |
