oj.uz

Submission #984776

# Submission time Handle Problem Language Result Execution time Memory
984776 2024-05-17T05:22:22 Z Aiperiii Swapping Cities (APIO20_swap) C++14
0 / 100
 71 ms 8980 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;

void init(int N, int M,vector<int> U,vector<int> V,vector<int> W) {

}

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

/*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
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 18 ms 3784 KB Output is correct
10 Correct 22 ms 4692 KB Output is correct
11 Correct 22 ms 4616 KB Output is correct
12 Correct 27 ms 4808 KB Output is correct
13 Correct 23 ms 4688 KB Output is correct
14 Correct 22 ms 4168 KB Output is correct
15 Correct 64 ms 8768 KB Output is correct
16 Correct 71 ms 8612 KB Output is correct
17 Correct 65 ms 8980 KB Output is correct
18 Correct 65 ms 8772 KB Output is correct
19 Incorrect 38 ms 4956 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 60 ms 7924 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 18 ms 3784 KB Output is correct
10 Correct 22 ms 4692 KB Output is correct
11 Correct 22 ms 4616 KB Output is correct
12 Correct 27 ms 4808 KB Output is correct
13 Correct 23 ms 4688 KB Output is correct
14 Correct 22 ms 4168 KB Output is correct
15 Correct 64 ms 8768 KB Output is correct
16 Correct 71 ms 8612 KB Output is correct
17 Correct 65 ms 8980 KB Output is correct
18 Correct 65 ms 8772 KB Output is correct
19 Incorrect 60 ms 7924 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

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