Submission #605518

#	Time	Username	Problem	Language	Result	Execution time	Memory
605518		AugustinasJucas	Game (APIO22_game)	C++17	2 / 100	1 ms	208 KiB

game

#include "game.h"
#include <bits/stdc++.h>
using namespace std;
const int dydis = 1001;
bitset<dydis> can[dydis];
int n, k;
void init(int N, int K) {
    n = N; k = K;
    //for(int i = 0 ; i < n; i++) can[i][i] = 1;
    for(int i = 0; i < k-1; i++) {
        for(int j = i+1; j < k; j++) {
            can[i][j] = true;
        }
    }
}

int add_teleporter(int u, int v) {
    for(int i = 0; i < n; i++) {
        if(!can[i][u]) continue;
        can[i] |= can[v];
    }
    can[u][v] = 1;
    can[u] |= can[v];
   /* cout << "kai pridejau " << u << " -> " << v << ":\n";
    for(int i = 0; i < n; i++) {
        cout << i << " gali i: ";
        for(int j = 0; j < n; j++) {
            if(can[i][j]) cout << j << ", ";
        }
        cout << endl;
    }*/
    for(int i = 0; i < k; i++) {
     //   if(i == 0 || i == v) continue;
        if(can[i][u] && can[u][i]) {
            //cout << "pora "<< i << " ir " << u << endl;
            return 1;
        }

        if(can[i][v] && can[v][i]) {
            //cout << "pora "<< i << " ir " << v << endl;
            return 1;
        }
    }
    return 0;
}
/*
6 5 3
3 4
5 0
4 5
5 3
1 4
*/

• Subtask 1: 2 / 2
• Subtask 2: 0 / 10
• Subtask 3: 0 / 18
• Subtask 4: 0 / 30
• Subtask 5: 0 / 40