oj.uz

Submission #682943

# Submission time Handle Problem Language Result Execution time Memory
682943 2023-01-17T10:10:38 Z Nursik Swapping Cities (APIO20_swap) C++14
13 / 100
 354 ms 37604 KB 
#include "swap.h"

#include <stdio.h>
 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define mp make_pair
#define f first
#define s second
#define pb push_back

const int maxn = 1e6 + 200;

int subtask2 = 1, subtask1 = 1;
multiset<int> setik;
vector<pair<int, int>> g[maxn];
int ver, reb;
void init(int n, int m, vector<int> u, vector<int> v, vector<int> w) {
    for (int i = 0; i < m; ++i){
        int x = u[i], y = v[i];
        g[x].pb(mp(y, w[i]));
        g[y].pb(mp(x, w[i]));
    }
    for (auto it : u){
        subtask2 &= (it == 0);
    }
    for (auto it : w){
        setik.insert(it);
    }
    for (int i = 1; i <= n; ++i){
        int sz = (int)g[i].size();
        subtask1 &= (sz <= 2);
    }
    ver = n, reb = m;
}

int getMinimumFuelCapacity(int x, int y) {
    if (subtask2 == 1){
    if (x == 0){
        int cur = g[y][0].s;
        setik.erase(setik.find(cur));
        int sz = (int)setik.size();
        if (sz == 0){
            setik.insert(cur);
            return -1;
        }
        sz -= 1;
        int cur2 = *setik.begin();
        setik.erase(setik.find(cur2));
        if (sz == 0){
            setik.insert(cur);
            setik.insert(cur2);
            return -1;
        }
        sz -= 1;
        int cur3 = *setik.begin();
        setik.insert(cur);
        setik.insert(cur2);
        return max({cur, cur2, cur3});
    }
    int cur = g[x][0].s;
    int cur2 = g[y][0].s;
    setik.erase(setik.find(cur));
    setik.erase(setik.find(cur2));
    if ((int)setik.size() == 0){
        setik.insert(cur);
        setik.insert(cur2);
        return -1;
    }
    int cur3 = *setik.begin();
    setik.insert(cur);
    setik.insert(cur2);
    return max({cur, cur2, cur3});
    }
    if (subtask1 == 1){
        if (reb == ver - 1){
            return -1;
        }
        else{
            return *setik.rbegin();
        }
    }
}

Compilation message

swap.cpp: In function 'int getMinimumFuelCapacity(int, int)':
swap.cpp:108:1: warning: control reaches end of non-void function [-Wreturn-type]
  108 | }
      | ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 14 ms 23812 KB Output is correct
5 Correct 13 ms 23888 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 13 ms 23868 KB Output is correct
8 Correct 12 ms 23764 KB Output is correct
9 Correct 65 ms 31760 KB Output is correct
10 Correct 71 ms 33500 KB Output is correct
11 Correct 71 ms 33320 KB Output is correct
12 Correct 83 ms 33912 KB Output is correct
13 Correct 79 ms 33924 KB Output is correct
14 Correct 67 ms 31888 KB Output is correct
15 Correct 121 ms 35424 KB Output is correct
16 Correct 156 ms 35164 KB Output is correct
17 Correct 126 ms 35684 KB Output is correct
18 Correct 121 ms 35636 KB Output is correct
19 Correct 60 ms 28772 KB Output is correct
20 Correct 134 ms 36500 KB Output is correct
21 Correct 119 ms 36472 KB Output is correct
22 Correct 129 ms 37120 KB Output is correct
23 Correct 123 ms 37132 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 304 ms 37080 KB Output is correct
4 Correct 285 ms 37476 KB Output is correct
5 Correct 354 ms 37604 KB Output is correct
6 Correct 304 ms 37464 KB Output is correct
7 Correct 342 ms 37592 KB Output is correct
8 Correct 309 ms 37104 KB Output is correct
9 Correct 310 ms 37392 KB Output is correct
10 Correct 292 ms 37064 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 14 ms 23812 KB Output is correct
5 Correct 13 ms 23888 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 13 ms 23868 KB Output is correct
8 Correct 12 ms 23764 KB Output is correct
9 Incorrect 12 ms 23764 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 14 ms 23812 KB Output is correct
5 Correct 13 ms 23888 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 13 ms 23868 KB Output is correct
8 Correct 12 ms 23764 KB Output is correct
9 Correct 65 ms 31760 KB Output is correct
10 Correct 71 ms 33500 KB Output is correct
11 Correct 71 ms 33320 KB Output is correct
12 Correct 83 ms 33912 KB Output is correct
13 Correct 79 ms 33924 KB Output is correct
14 Correct 67 ms 31888 KB Output is correct
15 Correct 121 ms 35424 KB Output is correct
16 Correct 156 ms 35164 KB Output is correct
17 Correct 126 ms 35684 KB Output is correct
18 Correct 121 ms 35636 KB Output is correct
19 Correct 304 ms 37080 KB Output is correct
20 Correct 285 ms 37476 KB Output is correct
21 Correct 354 ms 37604 KB Output is correct
22 Correct 304 ms 37464 KB Output is correct
23 Correct 342 ms 37592 KB Output is correct
24 Correct 309 ms 37104 KB Output is correct
25 Correct 310 ms 37392 KB Output is correct
26 Correct 292 ms 37064 KB Output is correct
27 Incorrect 13 ms 23892 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

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