Submission #369677

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
369677	2021-02-22T08:04:38 Z	CodePlatina	Meetings (JOI19_meetings)	C++14	17 / 100	2000 ms	492 KB

meetings

#include "meetings.h"

using namespace std;

void Solve(int N)
{
    for(int i = 0; i < N; ++i)
    {
        for(int j = i + 1; j < N; ++j)
        {
            bool flag = true;
            for(int k = 0; k < N; ++k) if(k != i && k != j)
            {
                int t = Query(i, j, k);
                if(i != t && j != t)
                {
                    flag = false;
                    break;
                }
            }
            if(flag) Bridge(i, j);
        }
    }
}

Subtask #1

7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	1 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	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	0 ms	364 KB	Output is correct
8	Correct	0 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	400 KB	Output is correct
12	Correct	0 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	1 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	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	0 ms	364 KB	Output is correct
8	Correct	0 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	400 KB	Output is correct
12	Correct	0 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	3 ms	364 KB	Output is correct
15	Correct	3 ms	364 KB	Output is correct
16	Correct	3 ms	364 KB	Output is correct
17	Correct	3 ms	364 KB	Output is correct
18	Correct	3 ms	364 KB	Output is correct
19	Correct	2 ms	364 KB	Output is correct
20	Correct	2 ms	364 KB	Output is correct
21	Correct	2 ms	364 KB	Output is correct
22	Correct	2 ms	364 KB	Output is correct
23	Correct	5 ms	364 KB	Output is correct
24	Correct	6 ms	364 KB	Output is correct
25	Correct	7 ms	364 KB	Output is correct
26	Correct	17 ms	364 KB	Output is correct

Subtask #3

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	1 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	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	0 ms	364 KB	Output is correct
8	Correct	0 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	400 KB	Output is correct
12	Correct	0 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	3 ms	364 KB	Output is correct
15	Correct	3 ms	364 KB	Output is correct
16	Correct	3 ms	364 KB	Output is correct
17	Correct	3 ms	364 KB	Output is correct
18	Correct	3 ms	364 KB	Output is correct
19	Correct	2 ms	364 KB	Output is correct
20	Correct	2 ms	364 KB	Output is correct
21	Correct	2 ms	364 KB	Output is correct
22	Correct	2 ms	364 KB	Output is correct
23	Correct	5 ms	364 KB	Output is correct
24	Correct	6 ms	364 KB	Output is correct
25	Correct	7 ms	364 KB	Output is correct
26	Correct	17 ms	364 KB	Output is correct
27	Incorrect	364 ms	432 KB	Wrong Answer [2]
28	Halted	0 ms	0 KB	-

Subtask #4

0 / 71.0

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