Submission #612634

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
612634	2022-07-29T18:37:12 Z	AugustinasJucas	Swapping Cities (APIO20_swap)	C++14	0 / 100	108 ms	14708 KB

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.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2660 KB	Output is correct
2	Correct	1 ms	2644 KB	Output is correct
3	Correct	2 ms	2644 KB	Output is correct
4	Correct	2 ms	2644 KB	Output is correct
5	Correct	3 ms	2644 KB	Output is correct
6	Correct	3 ms	2716 KB	Output is correct
7	Correct	3 ms	2644 KB	Output is correct
8	Correct	2 ms	2644 KB	Output is correct
9	Correct	36 ms	8820 KB	Output is correct
10	Correct	32 ms	10316 KB	Output is correct
11	Correct	35 ms	10156 KB	Output is correct
12	Correct	35 ms	10572 KB	Output is correct
13	Correct	34 ms	10560 KB	Output is correct
14	Correct	31 ms	9196 KB	Output is correct
15	Correct	90 ms	14448 KB	Output is correct
16	Correct	85 ms	14188 KB	Output is correct
17	Correct	108 ms	14700 KB	Output is correct
18	Correct	80 ms	14708 KB	Output is correct
19	Incorrect	46 ms	7800 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2660 KB	Output is correct
2	Correct	1 ms	2644 KB	Output is correct
3	Incorrect	86 ms	13652 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2660 KB	Output is correct
2	Correct	1 ms	2644 KB	Output is correct
3	Correct	2 ms	2644 KB	Output is correct
4	Correct	2 ms	2644 KB	Output is correct
5	Correct	3 ms	2644 KB	Output is correct
6	Correct	3 ms	2716 KB	Output is correct
7	Correct	3 ms	2644 KB	Output is correct
8	Correct	2 ms	2644 KB	Output is correct
9	Incorrect	2 ms	2644 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	2644 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2660 KB	Output is correct
2	Correct	1 ms	2644 KB	Output is correct
3	Correct	2 ms	2644 KB	Output is correct
4	Correct	2 ms	2644 KB	Output is correct
5	Correct	3 ms	2644 KB	Output is correct
6	Correct	3 ms	2716 KB	Output is correct
7	Correct	3 ms	2644 KB	Output is correct
8	Correct	2 ms	2644 KB	Output is correct
9	Correct	36 ms	8820 KB	Output is correct
10	Correct	32 ms	10316 KB	Output is correct
11	Correct	35 ms	10156 KB	Output is correct
12	Correct	35 ms	10572 KB	Output is correct
13	Correct	34 ms	10560 KB	Output is correct
14	Correct	31 ms	9196 KB	Output is correct
15	Correct	90 ms	14448 KB	Output is correct
16	Correct	85 ms	14188 KB	Output is correct
17	Correct	108 ms	14700 KB	Output is correct
18	Correct	80 ms	14708 KB	Output is correct
19	Incorrect	86 ms	13652 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #6

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	2644 KB	Output isn't correct
2	Halted	0 ms	0 KB	-