oj.uz

Submission #344174

# Submission time Handle Problem Language Result Execution time Memory
344174 2021-01-05T08:20:50 Z beksultan04 Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1384 KB 
#include "meetings.h"
//#include "grader.cpp"
#include <bits/stdc++.h>

#define ll long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
using namespace std;
bool vis[2001],voobshe[2001];
set <int> g[2001];
void Solve(int N) {
    int x ,i,j,y=1;
    map <pii,bool> mp;
    /// krasava -_0
    x=0;
    for (i=1;i<N;++i){
        int cnt=g[x].size();
        for (int to : g[x]){
            if (to == x || to == i || i == x)continue;
            int a = x,b = to,c = i;
            int s = Query(x,to,i);
            if (s == x){
                cnt--;
                continue;
            }
            if (s == to){
                x = s;
                i--;
                break;
            }
            else if (s == i){
                g[x].erase(to);
                g[to].erase(x);
                g[x].insert(i);
                g[to].insert(i);
                g[i].insert(to);
                g[i].insert(x);
                break;
            }
            else {
                g[x].erase(to);
                g[to].erase(x);
                g[x].insert(s);
                g[to].insert(s);
                g[i].insert(s);

                g[s].insert(i);
                g[s].insert(to);
                g[s].insert(x);
                x=s;
                break;
            }
            cnt--;
        }
        if (cnt == 0){
            g[x].insert(i);
            g[i].insert(x);
        }
    }


//    for (i=0;i<N;++i){
//        cout <<i<<"- ";
//        for (int to : g[i]){
//            cout <<to<<" ";
//        }
//        endi;
//    }
    for (i=0;i<N;++i){
        for (int to : g[i]){
            if (i < to){
                Bridge(i,to);
            }
        }
    }


}

Compilation message

meetings.cpp: In function 'void Solve(int)':
meetings.cpp:30:17: warning: unused variable 'a' [-Wunused-variable]
   30 |             int a = x,b = to,c = i;
      |                 ^
meetings.cpp:30:23: warning: unused variable 'b' [-Wunused-variable]
   30 |             int a = x,b = to,c = i;
      |                       ^
meetings.cpp:30:30: warning: unused variable 'c' [-Wunused-variable]
   30 |             int a = x,b = to,c = i;
      |                              ^
meetings.cpp:22:14: warning: unused variable 'j' [-Wunused-variable]
   22 |     int x ,i,j,y=1;
      |              ^
meetings.cpp:22:16: warning: unused variable 'y' [-Wunused-variable]
   22 |     int x ,i,j,y=1;
      |                ^

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 524 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 23 ms 556 KB Output is correct
28 Correct 22 ms 640 KB Output is correct
29 Correct 21 ms 492 KB Output is correct
30 Correct 21 ms 512 KB Output is correct
31 Correct 19 ms 492 KB Output is correct
32 Correct 18 ms 492 KB Output is correct
33 Correct 25 ms 492 KB Output is correct
34 Correct 27 ms 492 KB Output is correct
35 Correct 30 ms 492 KB Output is correct
36 Correct 22 ms 492 KB Output is correct
37 Correct 107 ms 492 KB Output is correct
38 Correct 109 ms 620 KB Output is correct
39 Correct 3 ms 640 KB Output is correct

Subtask #4
0 / 71.0

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