oj.uz

답안 #984781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984781 2024-05-17T05:28:02 Z Aiperiii 자매 도시 (APIO20_swap) C++14
6 / 100
 72 ms 10184 KB 
#include <bits/stdc++.h>
#include "swap.h"
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
bool line=0;
int mx=0;
void init(int N, int M,vector<int> U,vector<int> V,vector<int> W) {
    if(M==N-1)line=1;
    else{
        for(int i=0;i<M;i++)mx=max(mx,W[i]);
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    if(line==1)return -1;
    return mx;
}

/*signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n,m;
    cin>>n>>m;
    vector <int> a(m),b(m),c(m);
    for(int i=0;i<m;i++){
        cin>>a[i]>>b[i]>>c[i];
    }
    init(n,m,a,b,c);
    int q;
    cin>>q;
    while(q--){
        int u,v;
        cin>>u>>v;
        cout<<getMinimumFuelCapacity(u,v)<<"\n";
    }
}*/
/*
 3
 1 10
 3 10
 8 15
 
2
1 2
2 3
*/

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 18 ms 2140 KB Output is correct
10 Correct 22 ms 2588 KB Output is correct
11 Correct 21 ms 2640 KB Output is correct
12 Correct 23 ms 2652 KB Output is correct
13 Correct 25 ms 2648 KB Output is correct
14 Correct 24 ms 2276 KB Output is correct
15 Correct 64 ms 4312 KB Output is correct
16 Correct 61 ms 4356 KB Output is correct
17 Correct 62 ms 4480 KB Output is correct
18 Correct 62 ms 4320 KB Output is correct
19 Correct 37 ms 4120 KB Output is correct
20 Correct 62 ms 9640 KB Output is correct
21 Correct 66 ms 10000 KB Output is correct
22 Correct 72 ms 10168 KB Output is correct
23 Correct 66 ms 10184 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 17.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 18 ms 2140 KB Output is correct
10 Correct 22 ms 2588 KB Output is correct
11 Correct 21 ms 2640 KB Output is correct
12 Correct 23 ms 2652 KB Output is correct
13 Correct 25 ms 2648 KB Output is correct
14 Correct 24 ms 2276 KB Output is correct
15 Correct 64 ms 4312 KB Output is correct
16 Correct 61 ms 4356 KB Output is correct
17 Correct 62 ms 4480 KB Output is correct
18 Correct 62 ms 4320 KB Output is correct
19 Incorrect 59 ms 4224 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

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