oj.uz

Submission #243603

# Submission time Handle Problem Language Result Execution time Memory
243603 2020-07-01T11:50:00 Z osaaateiasavtnl Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 4484 KB 
#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cout << #x << ": " << x << '\n';

const int N = 2007;
bool par[N][N]; //is j parent of i
int sub[N];
int fath[N];
void Solve(int N) {
    int n = N;

    for (int i = 1; i < N; ++i)
        for (int j = i + 1; j < N; ++j) {
            int x = Query(0, i, j);
            if (x == i) 
                ++par[j][i];
            else if (x == j)    
                ++par[i][j];
        }   

    sub[0] = N;        
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            sub[i] += par[j][i];

    for (int i = 1; i < n; ++i) {
        fath[i] = 0;
        for (int j = 0; j < n; ++j) {
            if (par[i][j] && sub[j] < sub[fath[i]]) {
                fath[i] = j;
            }   
        }   

        int u = i, v = fath[i];
        if (v < u)
            swap(u, v);

        Bridge(u, v);
    }   
}

Compilation message

meetings.cpp: In function 'void Solve(int)':
meetings.cpp:26:27: warning: use of an operand of type 'bool' in 'operator++' is deprecated [-Wdeprecated]
                 ++par[j][i];
                           ^
meetings.cpp:28:27: warning: use of an operand of type 'bool' in 'operator++' is deprecated [-Wdeprecated]
                 ++par[i][j];
                           ^

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 157 ms 1040 KB Output is correct
28 Correct 151 ms 1024 KB Output is correct
29 Correct 149 ms 1016 KB Output is correct
30 Correct 151 ms 1144 KB Output is correct
31 Correct 156 ms 1144 KB Output is correct
32 Correct 168 ms 1016 KB Output is correct
33 Correct 152 ms 1016 KB Output is correct
34 Correct 156 ms 960 KB Output is correct
35 Correct 144 ms 1144 KB Output is correct
36 Correct 146 ms 1052 KB Output is correct
37 Correct 227 ms 1044 KB Output is correct
38 Correct 220 ms 1144 KB Output is correct
39 Correct 201 ms 1024 KB Output is correct

Subtask #4
0 / 71.0

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