oj.uz

답안 #553143

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
553143 2022-04-24T18:51:52 Z Itamar 자매 도시 (APIO20_swap) C++14
50 / 100
 559 ms 39532 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 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

# 결과 실행 시간 메모리 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 145 ms 25048 KB Output is correct
10 Correct 212 ms 30084 KB Output is correct
11 Correct 202 ms 29368 KB Output is correct
12 Correct 189 ms 31416 KB Output is correct
13 Correct 120 ms 23600 KB Output is correct
14 Correct 198 ms 25016 KB Output is correct
15 Correct 295 ms 32156 KB Output is correct
16 Correct 333 ms 31336 KB Output is correct
17 Correct 310 ms 33328 KB Output is correct
18 Correct 219 ms 25124 KB Output is correct
19 Correct 173 ms 7956 KB Output is correct
20 Correct 417 ms 32256 KB Output is correct
21 Correct 501 ms 31160 KB Output is correct
22 Correct 559 ms 33208 KB Output is correct
23 Correct 267 ms 25180 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 262 ms 23352 KB Output is correct
4 Correct 234 ms 24504 KB Output is correct
5 Correct 269 ms 23804 KB Output is correct
6 Correct 225 ms 24376 KB Output is correct
7 Correct 274 ms 24124 KB Output is correct
8 Correct 216 ms 23132 KB Output is correct
9 Correct 233 ms 23976 KB Output is correct
10 Correct 255 ms 22876 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 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 2 ms 480 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 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 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 1 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 2 ms 596 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 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 145 ms 25048 KB Output is correct
11 Correct 212 ms 30084 KB Output is correct
12 Correct 202 ms 29368 KB Output is correct
13 Correct 189 ms 31416 KB Output is correct
14 Correct 120 ms 23600 KB Output is correct
15 Correct 2 ms 480 KB Output is correct
16 Correct 2 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 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 1 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 2 ms 596 KB Output is correct
34 Correct 14 ms 4096 KB Output is correct
35 Correct 236 ms 31136 KB Output is correct
36 Correct 197 ms 30744 KB Output is correct
37 Correct 179 ms 29988 KB Output is correct
38 Correct 182 ms 28964 KB Output is correct
39 Correct 210 ms 28468 KB Output is correct
40 Correct 163 ms 25936 KB Output is correct
41 Correct 196 ms 31828 KB Output is correct
42 Correct 235 ms 31820 KB Output is correct
43 Correct 127 ms 23540 KB Output is correct
44 Correct 231 ms 28556 KB Output is correct
45 Correct 179 ms 24900 KB Output is correct
46 Correct 205 ms 30660 KB Output is correct
47 Correct 177 ms 27716 KB Output is correct
48 Correct 153 ms 24856 KB Output is correct
49 Correct 91 ms 14332 KB Output is correct
50 Correct 76 ms 10980 KB Output is correct
51 Correct 159 ms 20740 KB Output is correct
52 Correct 236 ms 34428 KB Output is correct
53 Correct 240 ms 32188 KB Output is correct
54 Correct 362 ms 39532 KB Output is correct
55 Correct 117 ms 23484 KB Output is correct
56 Correct 223 ms 30364 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 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 145 ms 25048 KB Output is correct
10 Correct 212 ms 30084 KB Output is correct
11 Correct 202 ms 29368 KB Output is correct
12 Correct 189 ms 31416 KB Output is correct
13 Correct 120 ms 23600 KB Output is correct
14 Correct 198 ms 25016 KB Output is correct
15 Correct 295 ms 32156 KB Output is correct
16 Correct 333 ms 31336 KB Output is correct
17 Correct 310 ms 33328 KB Output is correct
18 Correct 219 ms 25124 KB Output is correct
19 Correct 262 ms 23352 KB Output is correct
20 Correct 234 ms 24504 KB Output is correct
21 Correct 269 ms 23804 KB Output is correct
22 Correct 225 ms 24376 KB Output is correct
23 Correct 274 ms 24124 KB Output is correct
24 Correct 216 ms 23132 KB Output is correct
25 Correct 233 ms 23976 KB Output is correct
26 Correct 255 ms 22876 KB Output is correct
27 Correct 2 ms 480 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 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 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 14 ms 4096 KB Output is correct
37 Correct 236 ms 31136 KB Output is correct
38 Correct 197 ms 30744 KB Output is correct
39 Correct 179 ms 29988 KB Output is correct
40 Correct 182 ms 28964 KB Output is correct
41 Correct 210 ms 28468 KB Output is correct
42 Correct 163 ms 25936 KB Output is correct
43 Correct 196 ms 31828 KB Output is correct
44 Correct 235 ms 31820 KB Output is correct
45 Correct 127 ms 23540 KB Output is correct
46 Correct 231 ms 28556 KB Output is correct
47 Correct 38 ms 3856 KB Output is correct
48 Correct 460 ms 32908 KB Output is correct
49 Correct 472 ms 31916 KB Output is correct
50 Correct 456 ms 31952 KB Output is correct
51 Correct 416 ms 30904 KB Output is correct
52 Correct 459 ms 28576 KB Output is correct
53 Correct 297 ms 20464 KB Output is correct
54 Correct 529 ms 32712 KB Output is correct
55 Correct 519 ms 33708 KB Output is correct
56 Incorrect 256 ms 25036 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 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 145 ms 25048 KB Output is correct
11 Correct 212 ms 30084 KB Output is correct
12 Correct 202 ms 29368 KB Output is correct
13 Correct 189 ms 31416 KB Output is correct
14 Correct 120 ms 23600 KB Output is correct
15 Correct 198 ms 25016 KB Output is correct
16 Correct 295 ms 32156 KB Output is correct
17 Correct 333 ms 31336 KB Output is correct
18 Correct 310 ms 33328 KB Output is correct
19 Correct 219 ms 25124 KB Output is correct
20 Correct 262 ms 23352 KB Output is correct
21 Correct 234 ms 24504 KB Output is correct
22 Correct 269 ms 23804 KB Output is correct
23 Correct 225 ms 24376 KB Output is correct
24 Correct 274 ms 24124 KB Output is correct
25 Correct 216 ms 23132 KB Output is correct
26 Correct 233 ms 23976 KB Output is correct
27 Correct 255 ms 22876 KB Output is correct
28 Correct 2 ms 480 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 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 1 ms 468 KB Output is correct
37 Correct 14 ms 4096 KB Output is correct
38 Correct 236 ms 31136 KB Output is correct
39 Correct 197 ms 30744 KB Output is correct
40 Correct 179 ms 29988 KB Output is correct
41 Correct 182 ms 28964 KB Output is correct
42 Correct 210 ms 28468 KB Output is correct
43 Correct 163 ms 25936 KB Output is correct
44 Correct 196 ms 31828 KB Output is correct
45 Correct 235 ms 31820 KB Output is correct
46 Correct 127 ms 23540 KB Output is correct
47 Correct 231 ms 28556 KB Output is correct
48 Correct 38 ms 3856 KB Output is correct
49 Correct 460 ms 32908 KB Output is correct
50 Correct 472 ms 31916 KB Output is correct
51 Correct 456 ms 31952 KB Output is correct
52 Correct 416 ms 30904 KB Output is correct
53 Correct 459 ms 28576 KB Output is correct
54 Correct 297 ms 20464 KB Output is correct
55 Correct 529 ms 32712 KB Output is correct
56 Correct 519 ms 33708 KB Output is correct
57 Incorrect 256 ms 25036 KB Output isn't correct
58 Halted 0 ms 0 KB -