제출 #344074

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
344074		beksultan04	Meetings (JOI19_meetings)	C++14	0 / 100	3063 ms	5408 KiB

meetings

#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),i,j;
    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 ;
    }
    map <pii,bool> mp;
    /// krasava -_0

    for (i=1;i<N;++i){
        for (j=i+1;j<N;++j){
            int s = Query(0,i,j);
            if (s == 0){
                mp[{i,j}]=1;
            }
            else if (s == i){
                mp[{0,j}]=1;
            }
            else if (s == j){
                mp[{0,j}]=1;
            }
            else {
                mp[{0,i}]=1;
                mp[{0,j}]=1;
                mp[{i,j}]=1;
            }
        }
    }
    for (i=0;i<N;++i){
        for (j=i+1;j<N;++j){
            if (mp[{i,j}] == 0){
                Bridge(i,j);
            }
        }
    }
    ret ;

}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 71