oj.uz

Submission #712389

# Submission time Handle Problem Language Result Execution time Memory
712389 2023-03-18T18:01:01 Z Ronin13 Swapping Cities (APIO20_swap) C++14
23 / 100
 2000 ms 94424 KB 
#include "swap.h"
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define ull unsigned ll
#include <vector>

/*
5 6
0 1 4
0 2 4
1 2 1
1 3 2
1 4 10
2 3 3
3
1 2
2 4
0 1

*/
using namespace std;


const int nmax = 1000000;

vector <vector <pii> > g(nmax);

vector <vector <int> > cmp(nmax);

vector <pii> par[nmax];



int val[nmax];
int l[nmax], r[nmax];
void make_set(int v){
    par[v].pb({v, 0});
    cmp[v].pb(v);
    val[v] = 1e9 + 1;
    l[v] = r[v] = v;
}

void union_sets(int a, int b, int len){
    if(par[a].back().f == par[b].back().f){
        if(val[a] == 1e9 +1){
            int x = par[a].back().f;
            for(int to : cmp[x]){
                val[to] = len;
            }
        }
        return;
    }
    int x = par[a].back().f, y = par[b].back().f;
    if(cmp[x].size() < cmp[y].size())
        swap(x, y), swap(a, b);
    for(int to : cmp[y])
        cmp[x].pb(to), par[to].pb({x, len});
    if(val[x] == 1e9 + 1 || val[y] == 1e9 + 1){
        int mn = min(val[x], val[y]);
        if(mn != 1e9 + 1){
        for(int to : cmp[x])
            val[to] = min(val[to], len);
        return;}
    }
    if(val[x] == 1e9 + 1 && val[y] == 1e9 + 1){
    if(l[x] == a && l[y] == b){
        l[x] = r[y];
        return;
    }
    if(l[x] == a && r[y] == b){
        l[x] = l[y];
        return;
    }
    if(r[x] == a && l[y] == b){
        r[x] = r[y];
        return;
    }
    if(r[x] == a && r[y] == b){
        r[x] = l[y];
        return;
    }
    for(int to : cmp[x])
        val[to] =    min(val[to], len);
    }
}

void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    int n = N;
    vector <pair <int, pii> > ed;
    for(int i = 0; i < n; i++)
        make_set(i);
    for(int i = 0; i < M; i++){
        ed.pb({W[i], {U[i], V[i]}});
    }
    sort(ed.begin(), ed.end());
    for(int i = 0; i < ed.size(); i++){
        union_sets(ed[i].s.f, ed[i].s.s, ed[i].f);
        //cout << 1;
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    if(val[X] == 1e9 + 1)
        return -1;
    int x = X, y = Y;
    int sz = par[x].size() - 1;
    int sz2 = par[y].size() - 1;
    int ans = 1e9 + 1;
    while(sz >= 0 && sz2 >= 0){

        if(par[x][sz].f== par[y][sz2].f)
            ans = min(ans, max(par[x][sz].s, par[y][sz2].s));
        sz--;
        sz2--;
    }
  int u = max(min(val[X],val[y]), ans);
  if(u == 1e9 + 1)
    u = -1;
  return u;
}

Compilation message

swap.cpp: In function 'void init(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
swap.cpp:103:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |     for(int i = 0; i < ed.size(); i++){
      |                    ~~^~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 70740 KB Output is correct
2 Correct 33 ms 70748 KB Output is correct
3 Correct 33 ms 70740 KB Output is correct
4 Correct 34 ms 70824 KB Output is correct
5 Correct 35 ms 70908 KB Output is correct
6 Correct 35 ms 70932 KB Output is correct
7 Correct 36 ms 70940 KB Output is correct
8 Correct 35 ms 70864 KB Output is correct
9 Correct 162 ms 87760 KB Output is correct
10 Correct 184 ms 91296 KB Output is correct
11 Correct 210 ms 90944 KB Output is correct
12 Correct 205 ms 92104 KB Output is correct
13 Correct 137 ms 84596 KB Output is correct
14 Correct 164 ms 87836 KB Output is correct
15 Correct 257 ms 93452 KB Output is correct
16 Correct 230 ms 92784 KB Output is correct
17 Correct 232 ms 94024 KB Output is correct
18 Correct 185 ms 86272 KB Output is correct
19 Correct 95 ms 77208 KB Output is correct
20 Correct 256 ms 93524 KB Output is correct
21 Correct 254 ms 93052 KB Output is correct
22 Correct 296 ms 94424 KB Output is correct
23 Correct 207 ms 86732 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 70740 KB Output is correct
2 Correct 33 ms 70748 KB Output is correct
3 Execution timed out 2069 ms 83260 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 70740 KB Output is correct
2 Correct 33 ms 70748 KB Output is correct
3 Correct 33 ms 70740 KB Output is correct
4 Correct 34 ms 70824 KB Output is correct
5 Correct 35 ms 70908 KB Output is correct
6 Correct 35 ms 70932 KB Output is correct
7 Correct 36 ms 70940 KB Output is correct
8 Correct 35 ms 70864 KB Output is correct
9 Correct 33 ms 70740 KB Output is correct
10 Correct 34 ms 70856 KB Output is correct
11 Correct 35 ms 70960 KB Output is correct
12 Correct 36 ms 70940 KB Output is correct
13 Correct 36 ms 70840 KB Output is correct
14 Correct 34 ms 70920 KB Output is correct
15 Correct 35 ms 70920 KB Output is correct
16 Correct 36 ms 70868 KB Output is correct
17 Correct 35 ms 70900 KB Output is correct
18 Correct 37 ms 70884 KB Output is correct
19 Correct 36 ms 70860 KB Output is correct
20 Correct 35 ms 70880 KB Output is correct
21 Correct 36 ms 70928 KB Output is correct
22 Correct 34 ms 70892 KB Output is correct
23 Correct 34 ms 70888 KB Output is correct
24 Correct 39 ms 70864 KB Output is correct
25 Correct 35 ms 70860 KB Output is correct
26 Correct 35 ms 70976 KB Output is correct
27 Correct 35 ms 70788 KB Output is correct
28 Correct 36 ms 70868 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 70740 KB Output is correct
2 Correct 33 ms 70740 KB Output is correct
3 Correct 33 ms 70748 KB Output is correct
4 Correct 33 ms 70740 KB Output is correct
5 Correct 34 ms 70824 KB Output is correct
6 Correct 35 ms 70908 KB Output is correct
7 Correct 35 ms 70932 KB Output is correct
8 Correct 36 ms 70940 KB Output is correct
9 Correct 35 ms 70864 KB Output is correct
10 Correct 162 ms 87760 KB Output is correct
11 Correct 184 ms 91296 KB Output is correct
12 Correct 210 ms 90944 KB Output is correct
13 Correct 205 ms 92104 KB Output is correct
14 Correct 137 ms 84596 KB Output is correct
15 Correct 34 ms 70856 KB Output is correct
16 Correct 35 ms 70960 KB Output is correct
17 Correct 36 ms 70940 KB Output is correct
18 Correct 36 ms 70840 KB Output is correct
19 Correct 34 ms 70920 KB Output is correct
20 Correct 35 ms 70920 KB Output is correct
21 Correct 36 ms 70868 KB Output is correct
22 Correct 35 ms 70900 KB Output is correct
23 Correct 37 ms 70884 KB Output is correct
24 Correct 36 ms 70860 KB Output is correct
25 Correct 35 ms 70880 KB Output is correct
26 Correct 36 ms 70928 KB Output is correct
27 Correct 34 ms 70892 KB Output is correct
28 Correct 34 ms 70888 KB Output is correct
29 Correct 39 ms 70864 KB Output is correct
30 Correct 35 ms 70860 KB Output is correct
31 Correct 35 ms 70976 KB Output is correct
32 Correct 35 ms 70788 KB Output is correct
33 Correct 36 ms 70868 KB Output is correct
34 Correct 48 ms 73232 KB Output is correct
35 Correct 198 ms 92032 KB Output is correct
36 Correct 193 ms 91784 KB Output is correct
37 Correct 184 ms 91372 KB Output is correct
38 Correct 187 ms 90436 KB Output is correct
39 Correct 195 ms 90080 KB Output is correct
40 Correct 193 ms 88228 KB Output is correct
41 Correct 232 ms 92480 KB Output is correct
42 Correct 207 ms 92536 KB Output is correct
43 Execution timed out 2092 ms 82168 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 70740 KB Output is correct
2 Correct 33 ms 70748 KB Output is correct
3 Correct 33 ms 70740 KB Output is correct
4 Correct 34 ms 70824 KB Output is correct
5 Correct 35 ms 70908 KB Output is correct
6 Correct 35 ms 70932 KB Output is correct
7 Correct 36 ms 70940 KB Output is correct
8 Correct 35 ms 70864 KB Output is correct
9 Correct 162 ms 87760 KB Output is correct
10 Correct 184 ms 91296 KB Output is correct
11 Correct 210 ms 90944 KB Output is correct
12 Correct 205 ms 92104 KB Output is correct
13 Correct 137 ms 84596 KB Output is correct
14 Correct 164 ms 87836 KB Output is correct
15 Correct 257 ms 93452 KB Output is correct
16 Correct 230 ms 92784 KB Output is correct
17 Correct 232 ms 94024 KB Output is correct
18 Correct 185 ms 86272 KB Output is correct
19 Execution timed out 2069 ms 83260 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 70740 KB Output is correct
2 Correct 33 ms 70740 KB Output is correct
3 Correct 33 ms 70748 KB Output is correct
4 Correct 33 ms 70740 KB Output is correct
5 Correct 34 ms 70824 KB Output is correct
6 Correct 35 ms 70908 KB Output is correct
7 Correct 35 ms 70932 KB Output is correct
8 Correct 36 ms 70940 KB Output is correct
9 Correct 35 ms 70864 KB Output is correct
10 Correct 162 ms 87760 KB Output is correct
11 Correct 184 ms 91296 KB Output is correct
12 Correct 210 ms 90944 KB Output is correct
13 Correct 205 ms 92104 KB Output is correct
14 Correct 137 ms 84596 KB Output is correct
15 Correct 164 ms 87836 KB Output is correct
16 Correct 257 ms 93452 KB Output is correct
17 Correct 230 ms 92784 KB Output is correct
18 Correct 232 ms 94024 KB Output is correct
19 Correct 185 ms 86272 KB Output is correct
20 Execution timed out 2069 ms 83260 KB Time limit exceeded
21 Halted 0 ms 0 KB -