Submission #1166503

#	Time	Username	Problem	Language	Result	Execution time	Memory
1166503		Sang	마술쇼 (APIO24_show)	C++20	5 / 100	2 ms	380 KiB

Alice

#ifndef _Pbrngw_
#include "Alice.h"
#endif // _Pbrngw_
#include<bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(), (a).end()
#define task "kbsiudthw"

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<int, ii> pii;

const int N = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 2277;

vector<ii> Alice(){
    long long x = setN(5000);
    vector<ii> edges;
    if (x <= 5000){
        FOR (i, 1, 5000){
            if (i == x) continue;
            edges.pb({i, x});
        }
    }
    return edges;
}

#ifdef _Pbrngw_
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }

    return 0;
}

#endif // _Pbrngw_

Bob

#ifndef _Pbrngw_
#include "Bob.h"
#endif // _Pbrngw_
#include<bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(), (a).end()
#define task "kbsiudthw"

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<int, ii> pii;

const int N = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 2277;

long long Bob(vector<ii> V){
    vector<int> deg(5005, 0);
    for (ii &x : V){
        deg[x.fi]++;
        deg[x.se]++;
    }
    FOR (i, 1, 5000) if (deg[i] > 1) return i;
    assert(false);
}

#ifdef _Pbrngw_
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }

    return 0;
}

#endif // _Pbrngw_

• Subtask 1: 5 / 5
• Subtask 2: 0 / 30
• Subtask 3: 0 / 65