#include "meetings.h"
#include <vector>
#include <set>
#include <utility>
using namespace std;
vector < int > Next[2005];
int con[2005];
set < int > have;
set < int > tt;
vector < pair < int , int > > road;
void Solve(int N)
{
int t,i;
for(i=0;i<N;i++) have.insert(i);
while(have.size()>2)
{
for(auto i:have)
{
Next[i].clear();
con[i]=0;
}
for(auto i:have)
{
for(auto j:have)
{
for(auto k:have)
{
if(k>j&&j>i)
{
t=Query(i,j,k);
if(t==i)
{
con[i]++;
Next[j].push_back(i);
Next[k].push_back(i);
}
if(t==j)
{
con[j]++;
Next[i].push_back(j);
Next[k].push_back(j);
}
if(t==k)
{
con[k]++;
Next[i].push_back(k);
Next[j].push_back(k);
}
}
}
}
}
for(auto i:have)
{
if(con[i]==0)
{
road.push_back(make_pair(i,Next[i][0]));
tt.insert(i);
}
}
for(auto i:tt) have.erase(i);
tt.clear();
}
if(have.size()==2) road.push_back(make_pair(*have.begin(),*(prev(have.end()))));
for(auto i:road) Bridge(i.first,i.second);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
364 KB |
Wrong Answer [3] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
364 KB |
Wrong Answer [3] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
364 KB |
Wrong Answer [3] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3066 ms |
748 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |