제출 #163443

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
163443		davitmarg	Game (IOI14_game)	C++17	15 / 100	2 ms	504 KiB

game

/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;

#ifndef death
#include "game.h"
#endif

const int N = 1503;

int p[N], sz[N], s[N], n, comp, k;

int par(int v)
{
    if (p[v] == v)
        return v;
    return p[v] = par(p[v]);
}

void dsu(int a, int b)
{
    a = par(a);
    b = par(b);
    if (a == b)
        return;
    if (sz[b] > sz[a])
        swap(a, b);
    sz[a] += sz[b];
    s[a] += s[b];
    comp--;
    p[b] = a;
}

void initialize(int x)
{
    srand(time(NULL));
    n = comp = x;
    k = n * (n - 1) / 2;
    for (int i = 0; i < n; i++)
    {
        sz[i] = 1;
        p[i] = i;
    }
}

int hasEdge(int u, int v)
{
    int ans = 0;
    if (comp == 2)
        ans = 0;
    else if ((sz[par(u)] * (n - sz[par(u)]) == s[par(u)] + 1) || (sz[par(v)] * (n - sz[par(v)]) == s[par(v)] + 1))
        ans = 1;
    else if (k <= comp - 1 + n / 5)
        ans = 1;
    else if (par(v) == par(u))
        ans = 1;

    if (ans)
        dsu(u, v);
    else
    {
        s[par(u)]++;
        s[par(v)]++;
    }
    k--;
    return ans;
}

#ifdef death

int main()
{
    int N;
    cin >> N;
    initialize(N);
    N = N * (N - 1) / 2;
    while (N--)
    {
        int a, b;
        cin >> a >> b;
        cout << hasEdge(a, b) << endl;
    }
    return 0;
}

#endif

/*
 
 
*/

• Subtask 1: 15 / 15
• Subtask 2: 0 / 27
• Subtask 3: 0 / 58