Submission #203391

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
203391	2020-02-20T13:03:26 Z	mathking1021	Meetings (JOI19_meetings)	C++14	17 / 100	2000 ms	504 KB

meetings

#include "meetings.h"

int a[55][55][55];

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

Subtask #1

7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	248 KB	Output is correct
2	Correct	5 ms	380 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	248 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	4 ms	248 KB	Output is correct
9	Correct	4 ms	248 KB	Output is correct
10	Correct	5 ms	248 KB	Output is correct
11	Correct	4 ms	248 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	248 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	248 KB	Output is correct
2	Correct	5 ms	380 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	248 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	4 ms	248 KB	Output is correct
9	Correct	4 ms	248 KB	Output is correct
10	Correct	5 ms	248 KB	Output is correct
11	Correct	4 ms	248 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	248 KB	Output is correct
14	Correct	35 ms	376 KB	Output is correct
15	Correct	32 ms	356 KB	Output is correct
16	Correct	30 ms	248 KB	Output is correct
17	Correct	35 ms	248 KB	Output is correct
18	Correct	34 ms	248 KB	Output is correct
19	Correct	39 ms	376 KB	Output is correct
20	Correct	36 ms	248 KB	Output is correct
21	Correct	36 ms	248 KB	Output is correct
22	Correct	36 ms	248 KB	Output is correct
23	Correct	36 ms	248 KB	Output is correct
24	Correct	43 ms	248 KB	Output is correct
25	Correct	45 ms	248 KB	Output is correct
26	Correct	42 ms	248 KB	Output is correct

Subtask #3

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	248 KB	Output is correct
2	Correct	5 ms	380 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	248 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	4 ms	248 KB	Output is correct
9	Correct	4 ms	248 KB	Output is correct
10	Correct	5 ms	248 KB	Output is correct
11	Correct	4 ms	248 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	248 KB	Output is correct
14	Correct	35 ms	376 KB	Output is correct
15	Correct	32 ms	356 KB	Output is correct
16	Correct	30 ms	248 KB	Output is correct
17	Correct	35 ms	248 KB	Output is correct
18	Correct	34 ms	248 KB	Output is correct
19	Correct	39 ms	376 KB	Output is correct
20	Correct	36 ms	248 KB	Output is correct
21	Correct	36 ms	248 KB	Output is correct
22	Correct	36 ms	248 KB	Output is correct
23	Correct	36 ms	248 KB	Output is correct
24	Correct	43 ms	248 KB	Output is correct
25	Correct	45 ms	248 KB	Output is correct
26	Correct	42 ms	248 KB	Output is correct
27	Incorrect	337 ms	376 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	3079 ms	504 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-