oj.uz

Submission #978475

# Submission time Handle Problem Language Result Execution time Memory
978475 2024-05-09T08:52:38 Z happy_node Meetings (JOI19_meetings) C++17
29 / 100
 1773 ms 1576 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

const int MX=2005;

vector<pair<int,int>> edges;
bool vis[MX];

void dfs(int root, vector<int> v) {
        if(v.size()==1) {
                return;
        }

        vector<int> curRoot;
        vector<vector<int>> items;

        for(auto u:v) {
                if(u==root) continue;
                if(vis[u]) continue;

                int pt=0;
                for(auto r:curRoot) {
                        // at this subtree
                        int q=Query(root,r,u);

                        if(q==root) {
                                // not at this subtree
                                pt++;
                                continue;
                        }

                        // at this subtree
                        curRoot[pt]=q;
                        if(!vis[q]) items[pt].push_back(q);
                        vis[q]=true;
                        if(!vis[u]) items[pt].push_back(u);
                        vis[u]=true;
                        break;
                }

                if(!vis[u]) {
                        vis[u]=true;
                        curRoot.push_back(u);
                        items.push_back({u});
                }
        }

        for(auto u:v) {
                vis[u]=false;
        }

        int pt=0, sum=1;
        for(auto r:curRoot) {
                edges.push_back({root,r});
                sum+=items[pt].size();
                dfs(r,items[pt]);
                pt++;
        }
        assert(sum==v.size());
}

void Solve(int N) {
        vector<int> v;
        for(int i=0;i<N;i++) v.push_back(i);
        dfs(0,v);
        
        for(auto [u,v]:edges) {
                if(u>v) swap(u,v);
                Bridge(u,v);
        }
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from meetings.cpp:2:
meetings.cpp: In function 'void dfs(int, std::vector<int>)':
meetings.cpp:60:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         assert(sum==v.size());
      |                ~~~^~~~~~~~~~

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 344 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 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 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 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 344 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 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 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct

Subtask #3
12.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 344 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 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 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 10 ms 540 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 7 ms 344 KB Output is correct
30 Correct 9 ms 344 KB Output is correct
31 Correct 5 ms 528 KB Output is correct
32 Correct 5 ms 344 KB Output is correct
33 Correct 8 ms 524 KB Output is correct
34 Correct 10 ms 536 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Correct 8 ms 344 KB Output is correct
37 Correct 73 ms 712 KB Output is correct
38 Correct 94 ms 748 KB Output is correct
39 Correct 109 ms 836 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 1236 KB Output is correct
2 Correct 466 ms 600 KB Output is correct
3 Correct 497 ms 972 KB Output is correct
4 Correct 556 ms 832 KB Output is correct
5 Correct 525 ms 804 KB Output is correct
6 Correct 431 ms 920 KB Output is correct
7 Correct 517 ms 600 KB Output is correct
8 Correct 531 ms 928 KB Output is correct
9 Correct 579 ms 956 KB Output is correct
10 Correct 477 ms 760 KB Output is correct
11 Correct 599 ms 764 KB Output is correct
12 Incorrect 1773 ms 1576 KB Wrong Answer [2]
13 Halted 0 ms 0 KB -