Submission #163418

#	Time	Username	Problem	Language	Result	Execution time	Memory
163418		davitmarg	Game (IOI14_game)	C++17	0 / 100	3 ms	376 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 = 5003;

int p1[N], p2[N], sz1[N], sz2[N], s2[N], s1[N], n, comp, k;

int par1(int v)
{
    if (p1[v] == v)
        return v;
    return p1[v] = par1(p1[v]);
}

int par2(int v)
{
    if (p2[v] == v)
        return v;
    return p2[v] = par2(p2[v]);
}

void dsu1(int a, int b)
{
    a = par1(a);
    b = par1(b);
    if (a == b)
        return;
    if (sz1[b] > sz1[a])
        swap(a, b);
    sz1[a] += sz1[b];
    s1[a] += s1[b];
    comp--;
    p1[b] = a;
}

void dsu2(int a, int b)
{
    a = par2(a);
    b = par2(b);
    if (a == b)
        return;
    if (sz2[b] > sz2[a])
        swap(a, b);
    sz2[a] += sz2[b];
    p2[b] = a;
}

void initialize(int x)
{
    n = comp = x;
    k = n * (n - 1) / 2;
    for (int i = 1; i <= n; i++)
    {
        sz1[i] = sz2[i] = 1;
        p1[i] = p2[i] = i;
    }
}

int hasEdge(int u, int v)
{
    int ans = 0;
    if (par1(u) == par1(v))
        ans = 0;
    else if (comp == 2)
        ans = 0;
    else if ((sz1[par1(u)] * (n - sz1[par1(u)]) == s1[par1(u)] - 1) || (sz1[par1(v)] * (n - sz1[par1(v)]) == s1[par1(v)] - 1))
        ans = 1;
    else if (k == comp - 1)
        ans = 1;
    else
        ans = 0;

    if (ans)
        dsu1(u, v);
    else
    {
        s1[par1(u)]++;
        s1[par1(v)]++;
        dsu2(u, 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: 0 / 15
• Subtask 2: 0 / 27
• Subtask 3: 0 / 58