oj.uz

답안 #375117

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
375117 2021-03-09T03:17:14 Z daniel920712 Meetings (JOI19_meetings) C++14
17 / 100
 2000 ms 1132 KB 
#include "meetings.h"
#include <vector>
#include <set>
#include <utility>
#include <stdio.h>
using namespace std;
int how[2005][2005];
int con[2005];
int ans[55][55][55];
set < int > have;
set < int > tt;
vector < pair < int , int > > road;
void Solve(int N)
{
    int t,i,x,y;
    for(i=0;i<N;i++) have.insert(i);
    for(auto i:have) for(auto j:have) for(auto k:have) if(j>i&&k>j) ans[i][j][k]=Query(i,j,k);

    while(have.size()>2)
    {

        for(auto i:have)
        {
            //printf("aa %d\n",i);
            con[i]=0;
            for(auto j:have) how[i][j]=0;
        }
        //printf("\n");
        for(auto i:have)
        {
            for(auto j:have)
            {
                for(auto k:have)
                {
                    if(k>j&&j>i)
                    {
                        t=ans[i][j][k];
                        if(t==i)
                        {
                            con[i]++;
                            how[j][i]++;
                            how[k][i]++;
                        }
                        if(t==j)
                        {
                            con[j]++;
                            how[i][j]++;
                            how[k][j]++;
                        }
                        if(t==k)
                        {
                            con[k]++;
                            how[i][k]++;
                            how[j][k]++;
                        }
                    }
                }
            }
        }
        for(auto i:have)
        {
            if(con[i]==0)
            {
                x=0;
                y=0;
                for(auto j:have)
                {
                    x=max(x,how[i][j]);
                    if(x==how[i][j]) y=j;
                }
                road.push_back(make_pair(i,y));
                tt.insert(i);
            }
        }
        //if(tt.empty()) i=0/0;
        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(min(i.first,i.second),max(i.first,i.second));
    }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 14 ms 1004 KB Output is correct
15 Correct 13 ms 1004 KB Output is correct
16 Correct 12 ms 1004 KB Output is correct
17 Correct 14 ms 1004 KB Output is correct
18 Correct 14 ms 1004 KB Output is correct
19 Correct 16 ms 1004 KB Output is correct
20 Correct 12 ms 1004 KB Output is correct
21 Correct 13 ms 1004 KB Output is correct
22 Correct 13 ms 1004 KB Output is correct
23 Correct 16 ms 1004 KB Output is correct
24 Correct 23 ms 1004 KB Output is correct
25 Correct 24 ms 1132 KB Output is correct
26 Correct 21 ms 1004 KB Output is correct

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 14 ms 1004 KB Output is correct
15 Correct 13 ms 1004 KB Output is correct
16 Correct 12 ms 1004 KB Output is correct
17 Correct 14 ms 1004 KB Output is correct
18 Correct 14 ms 1004 KB Output is correct
19 Correct 16 ms 1004 KB Output is correct
20 Correct 12 ms 1004 KB Output is correct
21 Correct 13 ms 1004 KB Output is correct
22 Correct 13 ms 1004 KB Output is correct
23 Correct 16 ms 1004 KB Output is correct
24 Correct 23 ms 1004 KB Output is correct
25 Correct 24 ms 1132 KB Output is correct
26 Correct 21 ms 1004 KB Output is correct
27 Incorrect 354 ms 492 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3070 ms 876 KB Time limit exceeded
2 Halted 0 ms 0 KB -