Submission #612634

#	Time	Username	Problem	Language	Result	Execution time	Memory
612634		AugustinasJucas	자매 도시 (APIO20_swap)	C++14	0 / 100	108 ms	14708 KiB

swap

#include "swap.h"
#include <bits/stdc++.h>
using namespace std;

vector<pair<int, pair<int, int> > > brn;
const int dydis = 1e5 + 10;
int tevas[dydis];
int kadaCiklas[dydis];
bool turiCikla[dydis] = {};
vector<int> nodes[dydis];

int n, m;
int fp(int v) {
    if(tevas[v] == v) return v;
    return tevas[v] = fp(tevas[v]);
}
void conn(int a, int b, int t) {
    a = fp(a);
    b = fp(b);
    if(a == b) {
        if(turiCikla[a]) return ;
        turiCikla[a] = true;
     //   for(auto x : nodes[a]) kadaCiklas[]
    }else {

    }
}
void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    n = N; m = M;
    for(int i = 0; i < n; i++)  {
        tevas[i] = i;
        nodes[i] = {i};
    }

}

int getMinimumFuelCapacity(int X, int Y) {
  return -1;
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27