oj.uz

Submission #243614

# Submission time Handle Problem Language Result Execution time Memory
243614 2020-07-01T12:14:47 Z osaaateiasavtnl Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 632 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;
int par[N];
void Solve(int n) {
    
    for (int i = 1; i < n; ++i)
        par[i] = -1;
          
    queue <int> q;
    q.push(0);
    while (q.size()) {
        int u = q.front(); q.pop();

        vector <int> cur;                                
        for (int v = 0; v < n; ++v) {
            if (par[v] == -1 && (u == 0 || Query(0, u, v) == u)) {
                vector <bool> del(cur.size());
                bool ban = 0;
                for (int i = 0; i < cur.size(); ++i) {
                    int x = Query(0, v, cur[i]);
                    if (x == v) {
                        del[i] = 1;
                        continue;
                    }   
                    if (x == cur[i]) {
                        ban = 1;
                        break;
                    }
                }   
                if (!ban) {
                    vector <int> a = {v};                    
                    for (int i = 0; i < cur.size(); ++i)
                        if (!del[i])
                            a.app(cur[i]);
                    cur = a;
                }
            }
        }   

        for (int v : cur) {
            par[v] = u;            
            q.push(v);
        }   
    }   

    for (int i = 1; i < n; ++i) {
        int u = i;
        int v = par[i];
        if (v < u)
            swap(u, v);
        Bridge(u,v);
    }   
}

Compilation message

meetings.cpp: In function 'void Solve(int)':
meetings.cpp:32:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int i = 0; i < cur.size(); ++i) {
                                 ~~^~~~~~~~~~~~
meetings.cpp:45:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     for (int i = 0; i < cur.size(); ++i)
                                     ~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 416 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 195 ms 448 KB Output is correct
28 Correct 174 ms 384 KB Output is correct
29 Correct 155 ms 384 KB Output is correct
30 Correct 186 ms 384 KB Output is correct
31 Correct 152 ms 384 KB Output is correct
32 Correct 161 ms 512 KB Output is correct
33 Correct 128 ms 384 KB Output is correct
34 Correct 136 ms 452 KB Output is correct
35 Correct 99 ms 384 KB Output is correct
36 Correct 163 ms 444 KB Output is correct
37 Correct 328 ms 504 KB Output is correct
38 Correct 389 ms 384 KB Output is correct
39 Correct 428 ms 384 KB Output is correct

Subtask #4
0 / 71.0

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