답안 #394871

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
394871	2021-04-27T11:47:58 Z	Sugardorj	자매 도시 (APIO20_swap)	C++14	6 / 100	129 ms	11540 KB

swap

#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
long long  i,j,s,t;
long long link[261523],size[234567],l=12345678,r,tt,k,y,z,n,m,x;
pair<long long,long long>p[234567];

void init(int N, int M, vector <int> U, vector <int> V, vector <int> W) {
    n = N;
    m = M;
    for (i = 0; i <m; i ++){
        p[i].first=W[i];
        p[i].second=U[i]*l+V[i];
    }
    sort (p,p+m);
}

int getMinimumFuelCapacity(int u, int v) {
    if (n==m+1)
        return -1;
    
    return p[m-1].first;
}

Subtask #1

6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	45 ms	3268 KB	Output is correct
10	Correct	43 ms	3984 KB	Output is correct
11	Correct	40 ms	3984 KB	Output is correct
12	Correct	43 ms	4164 KB	Output is correct
13	Correct	42 ms	4172 KB	Output is correct
14	Correct	39 ms	3524 KB	Output is correct
15	Correct	112 ms	8920 KB	Output is correct
16	Correct	110 ms	9860 KB	Output is correct
17	Correct	108 ms	10156 KB	Output is correct
18	Correct	116 ms	10144 KB	Output is correct
19	Correct	63 ms	6280 KB	Output is correct
20	Correct	112 ms	11168 KB	Output is correct
21	Correct	116 ms	11340 KB	Output is correct
22	Correct	128 ms	11508 KB	Output is correct
23	Correct	127 ms	11540 KB	Output is correct

Subtask #2

0 / 7.0

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

Subtask #3

0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Incorrect	1 ms	204 KB	Output isn't correct

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	204 KB	Output isn't correct

Subtask #5

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	45 ms	3268 KB	Output is correct
10	Correct	43 ms	3984 KB	Output is correct
11	Correct	40 ms	3984 KB	Output is correct
12	Correct	43 ms	4164 KB	Output is correct
13	Correct	42 ms	4172 KB	Output is correct
14	Correct	39 ms	3524 KB	Output is correct
15	Correct	112 ms	8920 KB	Output is correct
16	Correct	110 ms	9860 KB	Output is correct
17	Correct	108 ms	10156 KB	Output is correct
18	Correct	116 ms	10144 KB	Output is correct
19	Incorrect	129 ms	5680 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #6

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	204 KB	Output isn't correct