oj.uz

Submission #553146

# Submission time Handle Problem Language Result Execution time Memory
553146 2022-04-24T18:57:37 Z Itamar Swapping Cities (APIO20_swap) C++14
50 / 100
 514 ms 39480 KB 
#include "swap.h"

#include <cassert>
#include <cstdio>
#pragma warning(disable : 4996)
#include <map>
#include <iostream>
using namespace std;
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#define ll long long
#define vi vector<int> 
#define vll vector<ll>
#define pi pair<int,int> 
#define pll pair<ll,ll>


vi col_v;
vector<vector<pi>> his;
vector<vi> col;
vector<pi> kats;
void uni(int i, int j, int t) {
    if (col_v[i] == col_v[j]) {
        if (his[i][0].first == -1) {
            for (int x : col[col_v[i]]) {
                his[x][0] = { t,-1 };
            }
        }
        return;
    }
    if (col[col_v[i]].size() > col[col_v[j]].size())
        swap(i, j);
    int c = col_v[j];
    int c1 = col_v[i];
    if (his[i][0].first != -1) {
        if (his[j][0].first == -1) {
            for (int x : col[c]) {
                his[x][0] = { t,-1 };
            }
        }
    }
    else if (his[j][0].first != -1) {
        if (his[i][0].first == -1) {
            for (int x : col[c1]) {
                his[x][0] = { t,-1 };
            }
        }
    }
    else if (i == kats[c1].first) {
        if (j == kats[c].second) {
            kats[c] = { kats[c1].second,kats[c].first };
        }
        else if (j == kats[c].first) {
            kats[c] = { kats[c1].second,kats[c].second };
        }
        else {
            for (int x : col[c1]) {
                his[x][0] = { t,-1 };
            }
            for (int x : col[c]) {
                his[x][0] = { t,-1 };
            }
        }
    }
    else if (i == kats[c1].second) {
        if (j == kats[c].second) {
            kats[c] = { kats[c1].first,kats[c].first };
        }
        else if (j == kats[c].first) {
            kats[c] = { kats[c1].first,kats[c].second };
        }
        else {
            for (int x : col[c1]) {
                his[x][0] = { t,-1 };
            }
            for (int x : col[c]) {
                his[x][0] = { t,-1 };
            }
        }
    }
    else {
        for (int x : col[c1]) {
            his[x][0] = { t,-1 };
        }
        for (int x : col[c]) {
            his[x][0] = { t,-1 };
        }
    }

    for (int x : col[col_v[i]]) {
        col_v[x] = c;
        col[col_v[j]].push_back(x);
        his[x].push_back({ t,c });
    }
}
void init(int N, int M,
    std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    col_v.resize(N);
    his.resize(N);
    vector<vi> v;
    for (int i = 0; i < N; i++) {
        his[i].push_back({ -1,-1 });
        his[i].push_back({ 0,i });
        kats.push_back( { i, i });
    }

    col.resize(N);
    for (int i = 0; i < N; i++) {
        col_v[i] = i;
        col[i].push_back(i);
    }
    for (int i = 0; i < M; i++) {
        v.push_back({ W[i],V[i],U[i] });
    }
    sort(v.begin(), v.end());
    for (vi vec : v) {
        uni(vec[1], vec[2], vec[0]);
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    
    vector<pi> v1 = his[X];
    vector<pi> v2 = his[Y];
    int s = max(v1[0].first, v2[0].first);
    int it1 = v1.size() - 1;
    int it2= v2.size() - 1;
    if (v1[0].first == -1)
        return -1;
    vector<vi> vec;
    for (int i = 1; i <= it1; i++) {
        vec.push_back({ v1[i].first,v1[i].second,1});
    }
    for (int i = 1; i <= it2; i++) {
        vec.push_back({ v2[i].first,v2[i].second,2 });
    }
    sort(vec.begin(), vec.end());
    int l1=-1, l2=-1;

    for (int i = 0; i < vec.size(); i++) {
        int now = vec[i][0];
        if (vec[i][2] == 1) {
            l1 = vec[i][1];
        }
        else {
            l2 = vec[i][1];
        }
        if (l1 == l2 ) {
            return max(now,s);
        }
    }
    return vec[vec.size()-1][0];
}

Compilation message

swap.cpp:5: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    5 | #pragma warning(disable : 4996)
      | 
swap.cpp: In function 'int getMinimumFuelCapacity(int, int)':
swap.cpp:142:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |     for (int i = 0; i < vec.size(); i++) {
      |                     ~~^~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 152 ms 25068 KB Output is correct
10 Correct 212 ms 30080 KB Output is correct
11 Correct 181 ms 29404 KB Output is correct
12 Correct 203 ms 31416 KB Output is correct
13 Correct 150 ms 23564 KB Output is correct
14 Correct 157 ms 24972 KB Output is correct
15 Correct 288 ms 32188 KB Output is correct
16 Correct 332 ms 31236 KB Output is correct
17 Correct 314 ms 33324 KB Output is correct
18 Correct 205 ms 25112 KB Output is correct
19 Correct 168 ms 7936 KB Output is correct
20 Correct 450 ms 32324 KB Output is correct
21 Correct 443 ms 31076 KB Output is correct
22 Correct 461 ms 33224 KB Output is correct
23 Correct 292 ms 25160 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 230 ms 23356 KB Output is correct
4 Correct 250 ms 24520 KB Output is correct
5 Correct 258 ms 23708 KB Output is correct
6 Correct 223 ms 24348 KB Output is correct
7 Correct 253 ms 24200 KB Output is correct
8 Correct 220 ms 23128 KB Output is correct
9 Correct 239 ms 24040 KB Output is correct
10 Correct 249 ms 22964 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 520 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 3 ms 596 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 152 ms 25068 KB Output is correct
11 Correct 212 ms 30080 KB Output is correct
12 Correct 181 ms 29404 KB Output is correct
13 Correct 203 ms 31416 KB Output is correct
14 Correct 150 ms 23564 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 520 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 3 ms 596 KB Output is correct
34 Correct 20 ms 4068 KB Output is correct
35 Correct 199 ms 31160 KB Output is correct
36 Correct 198 ms 30764 KB Output is correct
37 Correct 245 ms 30000 KB Output is correct
38 Correct 186 ms 28952 KB Output is correct
39 Correct 173 ms 28588 KB Output is correct
40 Correct 162 ms 25912 KB Output is correct
41 Correct 212 ms 31800 KB Output is correct
42 Correct 186 ms 31876 KB Output is correct
43 Correct 119 ms 23636 KB Output is correct
44 Correct 194 ms 28460 KB Output is correct
45 Correct 177 ms 24984 KB Output is correct
46 Correct 194 ms 30756 KB Output is correct
47 Correct 165 ms 27672 KB Output is correct
48 Correct 140 ms 24836 KB Output is correct
49 Correct 111 ms 14372 KB Output is correct
50 Correct 85 ms 10980 KB Output is correct
51 Correct 133 ms 20788 KB Output is correct
52 Correct 247 ms 34436 KB Output is correct
53 Correct 244 ms 32304 KB Output is correct
54 Correct 320 ms 39480 KB Output is correct
55 Correct 114 ms 23508 KB Output is correct
56 Correct 224 ms 30476 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 152 ms 25068 KB Output is correct
10 Correct 212 ms 30080 KB Output is correct
11 Correct 181 ms 29404 KB Output is correct
12 Correct 203 ms 31416 KB Output is correct
13 Correct 150 ms 23564 KB Output is correct
14 Correct 157 ms 24972 KB Output is correct
15 Correct 288 ms 32188 KB Output is correct
16 Correct 332 ms 31236 KB Output is correct
17 Correct 314 ms 33324 KB Output is correct
18 Correct 205 ms 25112 KB Output is correct
19 Correct 230 ms 23356 KB Output is correct
20 Correct 250 ms 24520 KB Output is correct
21 Correct 258 ms 23708 KB Output is correct
22 Correct 223 ms 24348 KB Output is correct
23 Correct 253 ms 24200 KB Output is correct
24 Correct 220 ms 23128 KB Output is correct
25 Correct 239 ms 24040 KB Output is correct
26 Correct 249 ms 22964 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 520 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 20 ms 4068 KB Output is correct
37 Correct 199 ms 31160 KB Output is correct
38 Correct 198 ms 30764 KB Output is correct
39 Correct 245 ms 30000 KB Output is correct
40 Correct 186 ms 28952 KB Output is correct
41 Correct 173 ms 28588 KB Output is correct
42 Correct 162 ms 25912 KB Output is correct
43 Correct 212 ms 31800 KB Output is correct
44 Correct 186 ms 31876 KB Output is correct
45 Correct 119 ms 23636 KB Output is correct
46 Correct 194 ms 28460 KB Output is correct
47 Correct 35 ms 3856 KB Output is correct
48 Correct 514 ms 32932 KB Output is correct
49 Correct 446 ms 31920 KB Output is correct
50 Correct 450 ms 31876 KB Output is correct
51 Correct 423 ms 30948 KB Output is correct
52 Correct 387 ms 28672 KB Output is correct
53 Correct 312 ms 20468 KB Output is correct
54 Correct 501 ms 32708 KB Output is correct
55 Correct 483 ms 33608 KB Output is correct
56 Incorrect 278 ms 25144 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 152 ms 25068 KB Output is correct
11 Correct 212 ms 30080 KB Output is correct
12 Correct 181 ms 29404 KB Output is correct
13 Correct 203 ms 31416 KB Output is correct
14 Correct 150 ms 23564 KB Output is correct
15 Correct 157 ms 24972 KB Output is correct
16 Correct 288 ms 32188 KB Output is correct
17 Correct 332 ms 31236 KB Output is correct
18 Correct 314 ms 33324 KB Output is correct
19 Correct 205 ms 25112 KB Output is correct
20 Correct 230 ms 23356 KB Output is correct
21 Correct 250 ms 24520 KB Output is correct
22 Correct 258 ms 23708 KB Output is correct
23 Correct 223 ms 24348 KB Output is correct
24 Correct 253 ms 24200 KB Output is correct
25 Correct 220 ms 23128 KB Output is correct
26 Correct 239 ms 24040 KB Output is correct
27 Correct 249 ms 22964 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 520 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 20 ms 4068 KB Output is correct
38 Correct 199 ms 31160 KB Output is correct
39 Correct 198 ms 30764 KB Output is correct
40 Correct 245 ms 30000 KB Output is correct
41 Correct 186 ms 28952 KB Output is correct
42 Correct 173 ms 28588 KB Output is correct
43 Correct 162 ms 25912 KB Output is correct
44 Correct 212 ms 31800 KB Output is correct
45 Correct 186 ms 31876 KB Output is correct
46 Correct 119 ms 23636 KB Output is correct
47 Correct 194 ms 28460 KB Output is correct
48 Correct 35 ms 3856 KB Output is correct
49 Correct 514 ms 32932 KB Output is correct
50 Correct 446 ms 31920 KB Output is correct
51 Correct 450 ms 31876 KB Output is correct
52 Correct 423 ms 30948 KB Output is correct
53 Correct 387 ms 28672 KB Output is correct
54 Correct 312 ms 20468 KB Output is correct
55 Correct 501 ms 32708 KB Output is correct
56 Correct 483 ms 33608 KB Output is correct
57 Incorrect 278 ms 25144 KB Output isn't correct
58 Halted 0 ms 0 KB -