oj.uz

Submission #344070

# Submission time Handle Problem Language Result Execution time Memory
344070 2021-01-05T05:37:54 Z beksultan04 Meetings (JOI19_meetings) C++14
17 / 100
 2000 ms 10476 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];
void Solve(int N) {
    int x = Query(0, 1, 2);
    if (N == 3){
        if (x == 0){
            Bridge(0,1);
            Bridge(0,2);
        }
        else if (x == 1){
            Bridge(1,2);
            Bridge(0,1);
        }
        else {
            Bridge(0,2);
            Bridge(1,2);
        }
        ret ;
    }
    int y = 1,i,j,cnt=0,k;
//    if (x == 1)y = 0;
//    vis[x]=1;
//    vis[y]=1;
//    while (1){
//        for (i=0;i<N;++i){
//            if (vis[i])continue;
//            int s = Query(x,y,i);
//            if (s != x && s != y && voobshe[s] == 0){
//                y = s;
//                for (j=0;j<N;++j)
//                    vis[j]=0;
//                vis[x]=1;
//                vis[y]=1;
//            }
//        }
//        cout <<x<<" "<<y<<"\n";
//        voobshe[x]=1;
//        x = y;
//        while (voobshe[y] || x == y){
//            y++;
//            y %= N;
//        }
//                vis[x]=1;
//                vis[y]=1;
//        OK
//    }


    map <pair<pii,int>,int > mp;
    for (i=0;i<N;++i){
        for (j=i+1;j<N;++j){
            vis[i]=1;vis[j]=1;

            bool f=1;
            for (k=0;k<N;++k){
                if (vis[k])continue;
                int a = i,b = j,c = k,s;
                /// our sort -_0
                if (a > b)swap(a,b);if (b > c)swap(b,c);if (a > b)swap(a,b);if (a > b)swap(a,b);if (b > c)swap(b,c);if (a > b)swap(a,b);
                if (mp.count({{a,b},c})==0){
                    s = Query(i,j,k);
                    mp[{{a,b},c}] = s;
                    {
                        int mass[3];
                        mass[0]=a;
                        mass[1]=b;
                        mass[2]=s;
                        sort(mass,mass+3);
                        mp[{{mass[0],mass[1]},mass[2]}] = s;

                    }
                    {
                        int mass[3];
                        mass[0]=a;
                        mass[1]=s;
                        mass[2]=c;
                        sort(mass,mass+3);
                        mp[{{mass[0],mass[1]},mass[2]}] = s;

                    }
                    {
                        int mass[3];
                        mass[0]=s;
                        mass[1]=b;
                        mass[2]=c;
                        sort(mass,mass+3);
                        mp[{{mass[0],mass[1]},mass[2]}] = s;

                    }
                }
                else s = mp[{{a,b},c}];

                if (s != i && s != j){
                    f=0;
                    break;
                }
                vis[k]=1;
            }
            if (f){
                Bridge(i, j);
            }
            for (k=0;k<N;++k)vis[k] = 0;
        }
    }

}

Compilation message

meetings.cpp: In function 'void Solve(int)':
meetings.cpp:76:17: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   76 |                 if (a > b)swap(a,b);if (b > c)swap(b,c);if (a > b)swap(a,b);if (a > b)swap(a,b);if (b > c)swap(b,c);if (a > b)swap(a,b);
      |                 ^~
meetings.cpp:76:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   76 |                 if (a > b)swap(a,b);if (b > c)swap(b,c);if (a > b)swap(a,b);if (a > b)swap(a,b);if (b > c)swap(b,c);if (a > b)swap(a,b);
      |                                     ^~
meetings.cpp:37:9: warning: unused variable 'y' [-Wunused-variable]
   37 |     int y = 1,i,j,cnt=0,k;
      |         ^
meetings.cpp:37:19: warning: unused variable 'cnt' [-Wunused-variable]
   37 |     int y = 1,i,j,cnt=0,k;
      |                   ^~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 6 ms 748 KB Output is correct
15 Correct 6 ms 748 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 6 ms 748 KB Output is correct
18 Correct 6 ms 748 KB Output is correct
19 Correct 5 ms 620 KB Output is correct
20 Correct 4 ms 620 KB Output is correct
21 Correct 4 ms 620 KB Output is correct
22 Correct 4 ms 620 KB Output is correct
23 Correct 7 ms 748 KB Output is correct
24 Correct 12 ms 1004 KB Output is correct
25 Correct 13 ms 1004 KB Output is correct
26 Correct 32 ms 1772 KB Output is correct
27 Incorrect 502 ms 10476 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

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