oj.uz

Submission #915568

# Submission time Handle Problem Language Result Execution time Memory
915568 2024-01-24T07:51:04 Z guagua0407 Meetings (JOI19_meetings) C++17
17 / 100
 1668 ms 1232 KB 
#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;

void Solve(int n) {
    vector<vector<bool>> ok(n,vector<bool>(n));
    for(int i=0;i<n;i++){
        int cnt=0;
        for(int j=i+1;j<n and cnt<18;j++){
            if(ok[i][j]) continue;
            bool tf=true;
            for(int k=0;k<n;k++){
                if(k==i or k==j) continue;
                int x=Query(i,j,k);
                if(x==k){
                    tf=false;
                    break;
                }
                else if(x!=i and x!=j){
                    ok[i][k]=ok[k][i]=ok[j][k]=ok[k][j]=true;
                }
            }
            if(tf){
                cnt++;
                Bridge(i,j);
            }
        }
    }
}

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 4 ms 344 KB Output is correct
21 Correct 4 ms 344 KB Output is correct
22 Correct 4 ms 488 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 12 ms 344 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 4 ms 344 KB Output is correct
21 Correct 4 ms 344 KB Output is correct
22 Correct 4 ms 488 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 12 ms 344 KB Output is correct
27 Incorrect 179 ms 524 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

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