답안 #741390

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
741390	2023-05-14T03:17:26 Z	vjudge1	자매 도시 (APIO20_swap)	C++17	0 / 100	108 ms	15436 KB

swap

#include "swap.h"

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

const int N = 1e5 + 5;
const int M = 2e5 + 5;
int n, m;
array<int, 3> edge[M];
vector <pair<int, int>> a[N];

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 < m; ++i){
    edge[i] = {U[i], V[i], W[i]};
    a[U[i]].push_back({V[i], W[i]});
    a[V[i]].push_back({U[i], W[i]});
  }
}

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

Subtask #1

0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2644 KB	Output is correct
2	Correct	2 ms	2772 KB	Output is correct
3	Correct	2 ms	2644 KB	Output is correct
4	Correct	2 ms	2644 KB	Output is correct
5	Correct	2 ms	2644 KB	Output is correct
6	Correct	2 ms	2644 KB	Output is correct
7	Correct	2 ms	2644 KB	Output is correct
8	Correct	2 ms	2772 KB	Output is correct
9	Correct	38 ms	9456 KB	Output is correct
10	Correct	45 ms	11056 KB	Output is correct
11	Correct	54 ms	10888 KB	Output is correct
12	Correct	62 ms	11360 KB	Output is correct
13	Correct	52 ms	11340 KB	Output is correct
14	Correct	42 ms	9808 KB	Output is correct
15	Correct	94 ms	15140 KB	Output is correct
16	Correct	102 ms	14952 KB	Output is correct
17	Correct	103 ms	15412 KB	Output is correct
18	Correct	108 ms	15436 KB	Output is correct
19	Incorrect	47 ms	8012 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #2

0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2644 KB	Output is correct
2	Correct	2 ms	2772 KB	Output is correct
3	Incorrect	89 ms	15176 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3

0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2644 KB	Output is correct
2	Correct	2 ms	2772 KB	Output is correct
3	Correct	2 ms	2644 KB	Output is correct
4	Correct	2 ms	2644 KB	Output is correct
5	Correct	2 ms	2644 KB	Output is correct
6	Correct	2 ms	2644 KB	Output is correct
7	Correct	2 ms	2644 KB	Output is correct
8	Correct	2 ms	2772 KB	Output is correct
9	Incorrect	1 ms	2644 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	2644 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2644 KB	Output is correct
2	Correct	2 ms	2772 KB	Output is correct
3	Correct	2 ms	2644 KB	Output is correct
4	Correct	2 ms	2644 KB	Output is correct
5	Correct	2 ms	2644 KB	Output is correct
6	Correct	2 ms	2644 KB	Output is correct
7	Correct	2 ms	2644 KB	Output is correct
8	Correct	2 ms	2772 KB	Output is correct
9	Correct	38 ms	9456 KB	Output is correct
10	Correct	45 ms	11056 KB	Output is correct
11	Correct	54 ms	10888 KB	Output is correct
12	Correct	62 ms	11360 KB	Output is correct
13	Correct	52 ms	11340 KB	Output is correct
14	Correct	42 ms	9808 KB	Output is correct
15	Correct	94 ms	15140 KB	Output is correct
16	Correct	102 ms	14952 KB	Output is correct
17	Correct	103 ms	15412 KB	Output is correct
18	Correct	108 ms	15436 KB	Output is correct
19	Incorrect	89 ms	15176 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #6

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	2644 KB	Output isn't correct
2	Halted	0 ms	0 KB	-