oj.uz

Submission #553149

# Submission time Handle Problem Language Result Execution time Memory
553149 2022-04-24T19:04:23 Z Itamar Swapping Cities (APIO20_swap) C++14
50 / 100
 500 ms 43632 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,1,v1[i].second });
    }
    for (int i = 1; i <= it2; i++) {
        vec.push_back({ v2[i].first,2,v2[i].second });
    }
    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][1] == 1) {
            l1 = vec[i][2];
        }
        else {
            l2 = vec[i][2];
        }
        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++) {
      |                     ~~^~~~~~~~~~~~
swap.cpp:125:26: warning: control reaches end of non-void function [-Wreturn-type]
  125 |     vector<pi> v1 = his[X];
      |                          ^

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 1 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 1 ms 468 KB Output is correct
9 Correct 142 ms 24984 KB Output is correct
10 Correct 214 ms 30084 KB Output is correct
11 Correct 195 ms 29356 KB Output is correct
12 Correct 220 ms 31408 KB Output is correct
13 Correct 127 ms 23572 KB Output is correct
14 Correct 182 ms 25016 KB Output is correct
15 Correct 279 ms 32144 KB Output is correct
16 Correct 281 ms 31192 KB Output is correct
17 Correct 305 ms 33328 KB Output is correct
18 Correct 198 ms 25144 KB Output is correct
19 Correct 215 ms 7944 KB Output is correct
20 Correct 461 ms 32232 KB Output is correct
21 Correct 435 ms 31104 KB Output is correct
22 Correct 478 ms 33196 KB Output is correct
23 Correct 271 ms 25164 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 255 ms 23328 KB Output is correct
4 Correct 298 ms 24512 KB Output is correct
5 Correct 233 ms 23680 KB Output is correct
6 Correct 248 ms 24380 KB Output is correct
7 Correct 257 ms 24092 KB Output is correct
8 Correct 225 ms 23244 KB Output is correct
9 Correct 244 ms 24032 KB Output is correct
10 Correct 239 ms 22900 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 1 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 1 ms 468 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 508 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 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 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 1 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 3 ms 616 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 2 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 1 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 1 ms 468 KB Output is correct
10 Correct 142 ms 24984 KB Output is correct
11 Correct 214 ms 30084 KB Output is correct
12 Correct 195 ms 29356 KB Output is correct
13 Correct 220 ms 31408 KB Output is correct
14 Correct 127 ms 23572 KB Output is correct
15 Correct 1 ms 508 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 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 2 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 1 ms 596 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 3 ms 616 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 14 ms 4108 KB Output is correct
35 Correct 217 ms 31168 KB Output is correct
36 Correct 214 ms 30656 KB Output is correct
37 Correct 185 ms 30128 KB Output is correct
38 Correct 191 ms 28972 KB Output is correct
39 Correct 202 ms 28476 KB Output is correct
40 Correct 152 ms 25908 KB Output is correct
41 Correct 204 ms 31844 KB Output is correct
42 Correct 231 ms 31800 KB Output is correct
43 Correct 124 ms 23568 KB Output is correct
44 Correct 176 ms 28460 KB Output is correct
45 Correct 149 ms 24928 KB Output is correct
46 Correct 194 ms 30772 KB Output is correct
47 Correct 187 ms 27688 KB Output is correct
48 Correct 143 ms 24896 KB Output is correct
49 Correct 93 ms 14372 KB Output is correct
50 Correct 73 ms 10992 KB Output is correct
51 Correct 133 ms 20840 KB Output is correct
52 Correct 261 ms 34428 KB Output is correct
53 Correct 241 ms 32200 KB Output is correct
54 Correct 297 ms 39480 KB Output is correct
55 Correct 120 ms 23524 KB Output is correct
56 Correct 216 ms 30384 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 1 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 1 ms 468 KB Output is correct
9 Correct 142 ms 24984 KB Output is correct
10 Correct 214 ms 30084 KB Output is correct
11 Correct 195 ms 29356 KB Output is correct
12 Correct 220 ms 31408 KB Output is correct
13 Correct 127 ms 23572 KB Output is correct
14 Correct 182 ms 25016 KB Output is correct
15 Correct 279 ms 32144 KB Output is correct
16 Correct 281 ms 31192 KB Output is correct
17 Correct 305 ms 33328 KB Output is correct
18 Correct 198 ms 25144 KB Output is correct
19 Correct 255 ms 23328 KB Output is correct
20 Correct 298 ms 24512 KB Output is correct
21 Correct 233 ms 23680 KB Output is correct
22 Correct 248 ms 24380 KB Output is correct
23 Correct 257 ms 24092 KB Output is correct
24 Correct 225 ms 23244 KB Output is correct
25 Correct 244 ms 24032 KB Output is correct
26 Correct 239 ms 22900 KB Output is correct
27 Correct 1 ms 508 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 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 14 ms 4108 KB Output is correct
37 Correct 217 ms 31168 KB Output is correct
38 Correct 214 ms 30656 KB Output is correct
39 Correct 185 ms 30128 KB Output is correct
40 Correct 191 ms 28972 KB Output is correct
41 Correct 202 ms 28476 KB Output is correct
42 Correct 152 ms 25908 KB Output is correct
43 Correct 204 ms 31844 KB Output is correct
44 Correct 231 ms 31800 KB Output is correct
45 Correct 124 ms 23568 KB Output is correct
46 Correct 176 ms 28460 KB Output is correct
47 Correct 37 ms 3856 KB Output is correct
48 Correct 437 ms 32948 KB Output is correct
49 Correct 464 ms 31832 KB Output is correct
50 Correct 433 ms 31916 KB Output is correct
51 Correct 410 ms 31072 KB Output is correct
52 Correct 424 ms 28736 KB Output is correct
53 Correct 303 ms 20444 KB Output is correct
54 Correct 454 ms 32908 KB Output is correct
55 Correct 500 ms 33608 KB Output is correct
56 Runtime error 175 ms 43632 KB Execution killed with signal 6
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 1 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 1 ms 468 KB Output is correct
10 Correct 142 ms 24984 KB Output is correct
11 Correct 214 ms 30084 KB Output is correct
12 Correct 195 ms 29356 KB Output is correct
13 Correct 220 ms 31408 KB Output is correct
14 Correct 127 ms 23572 KB Output is correct
15 Correct 182 ms 25016 KB Output is correct
16 Correct 279 ms 32144 KB Output is correct
17 Correct 281 ms 31192 KB Output is correct
18 Correct 305 ms 33328 KB Output is correct
19 Correct 198 ms 25144 KB Output is correct
20 Correct 255 ms 23328 KB Output is correct
21 Correct 298 ms 24512 KB Output is correct
22 Correct 233 ms 23680 KB Output is correct
23 Correct 248 ms 24380 KB Output is correct
24 Correct 257 ms 24092 KB Output is correct
25 Correct 225 ms 23244 KB Output is correct
26 Correct 244 ms 24032 KB Output is correct
27 Correct 239 ms 22900 KB Output is correct
28 Correct 1 ms 508 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 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 14 ms 4108 KB Output is correct
38 Correct 217 ms 31168 KB Output is correct
39 Correct 214 ms 30656 KB Output is correct
40 Correct 185 ms 30128 KB Output is correct
41 Correct 191 ms 28972 KB Output is correct
42 Correct 202 ms 28476 KB Output is correct
43 Correct 152 ms 25908 KB Output is correct
44 Correct 204 ms 31844 KB Output is correct
45 Correct 231 ms 31800 KB Output is correct
46 Correct 124 ms 23568 KB Output is correct
47 Correct 176 ms 28460 KB Output is correct
48 Correct 37 ms 3856 KB Output is correct
49 Correct 437 ms 32948 KB Output is correct
50 Correct 464 ms 31832 KB Output is correct
51 Correct 433 ms 31916 KB Output is correct
52 Correct 410 ms 31072 KB Output is correct
53 Correct 424 ms 28736 KB Output is correct
54 Correct 303 ms 20444 KB Output is correct
55 Correct 454 ms 32908 KB Output is correct
56 Correct 500 ms 33608 KB Output is correct
57 Runtime error 175 ms 43632 KB Execution killed with signal 6
58 Halted 0 ms 0 KB -