oj.uz

Submission #375098

# Submission time Handle Problem Language Result Execution time Memory
375098 2021-03-09T02:56:42 Z daniel920712 Meetings (JOI19_meetings) C++14
0 / 100
 2000 ms 1004 KB 
#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()))));
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3057 ms 1004 KB Time limit exceeded
2 Halted 0 ms 0 KB -