oj.uz

Submission #637984

# Submission time Handle Problem Language Result Execution time Memory
637984 2022-09-04T01:01:06 Z Cross_Ratio Reconstruction Project (JOI22_reconstruction) C++14
100 / 100
 1712 ms 30388 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
ll A[2005];
ll B[2005];
ll C[2005]; // C[i] <= x < C[i+1], ans = x * A[i] + B[i];
typedef pair<ll, ll> P;
ll dis[505][505];
ll dis2[505][505];
struct UnionFind {
    vector<int> root;
    UnionFind(int n) {
        root.resize(n);
        fill(root.begin(),root.end(),-1);
    }
    int Find(int n) {
        if(root[n]<0) return n;
        int r = Find(root[n]);
        root[n] = r;
        return r;
    }
    void Merge(int x, int y) {
        x = Find(x), y = Find(y);
        if(x==y) return;
        if(root[x]>root[y]) swap(x, y);
        root[x] += root[y];
        root[y] = x;
    }
};
vector<array<ll, 4>> Tree;
vector<set<array<ll, 4>>> adj;
array<ll, 4> Edge[100005];
bool S[100005];
vector<vector<array<int, 2>>> E;
vector<array<int, 3>> E2;
ll val[505];
ll par[505];
ll dep[505];
ll pid[505];
ll tid[100005];
void dfs(int c, int p, int d, int d2) {
    par[c] = p;
    dep[c] = d;
    pid[c] = d2;
    for(auto it : adj[c]) {
        if(it[0]==p) continue;
        dfs(it[0], c, d+1, it[2]);
    }
}
signed main() {
    cin.sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int N, M;
    cin >> N >> M;
    clock_t st = clock();
    adj.resize(N);
    int i, j;
    E.resize(N);
    for(i=0;i<M;i++) {
        int a, b, c;
        cin >> a>>b>>c;
        Edge[i] = {c, a-1, b-1, i};
    }
    for(i=0;i<M;i++) tid[i] = -1;
    sort(Edge, Edge+M);
    UnionFind UF(N);
    int cnt = 0;
    for(i=0;i<M;i++) {
        Edge[i][3] = i;
        if(UF.Find(Edge[i][1])==UF.Find(Edge[i][2])) continue;
        UF.Merge(Edge[i][1], Edge[i][2]);
        S[i] = true;
        adj[Edge[i][1]].insert({Edge[i][2], Edge[i][0], i});
        adj[Edge[i][2]].insert({Edge[i][1], Edge[i][0], i});
        val[cnt] = Edge[i][0];
        tid[i] = cnt;
        cnt++;
    }
    for(i=0;i<M;i++) {
        if(!S[i]) {
            dfs(0, -1, 0, -1);
            int a = Edge[i][1];
            int b = Edge[i][2];
            if(dep[a]<dep[b]) swap(a, b);
            ll val = INF, id = -1;
            while(dep[a]>dep[b]) {
                if(val > Edge[pid[a]][0]) {
                    val = Edge[pid[a]][0];
                    id = pid[a];
                }
                a = par[a];
            }
            while(a!=b) {
                if(val > Edge[pid[a]][0]) {
                    val = Edge[pid[a]][0];
                    id = pid[a];
                }
                if(val > Edge[pid[b]][0]) {
                    val = Edge[pid[b]][0];
                    id = pid[b];
                }
                a = par[a];
                b = par[b];
            }
            ll val2 = Edge[i][0];
            if(val <= val2) {
                ll time = (val2 + val + 1) / 2;
                E2.push_back({time, i, id});
                S[i] = true;
                S[id] = false;
                adj[Edge[id][1]].erase({Edge[id][2], Edge[id][0], id});
                adj[Edge[id][2]].erase({Edge[id][1], Edge[id][0], id});
                adj[Edge[i][1]].insert({Edge[i][2], Edge[i][0], i});
                adj[Edge[i][2]].insert({Edge[i][1], Edge[i][0], i});
            }
        }
    }
    sort(E2.begin(),E2.end());
    int Q;
    cin >> Q;
    int pt = -1;
    while(Q--) {
        ll x;
        ll ans = 0;
        cin >> x;
        while(pt+1<E2.size()&&x>=E2[pt+1][0]) {
            pt++;
            int id1 = E2[pt][1], id2 = E2[pt][2];
            tid[id1] = tid[id2];
            tid[id2] = -1;
            val[tid[id1]] = Edge[id1][0];
        }
        for(i=0;i<N-1;i++) ans += abs(x - val[i]);
        cout << ans << '\n';
    }
}

Compilation message

reconstruction.cpp: In function 'int main()':
reconstruction.cpp:110:31: warning: narrowing conversion of 'time' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
  110 |                 E2.push_back({time, i, id});
      |                               ^~~~
reconstruction.cpp:110:40: warning: narrowing conversion of 'id' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
  110 |                 E2.push_back({time, i, id});
      |                                        ^~
reconstruction.cpp:128:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |         while(pt+1<E2.size()&&x>=E2[pt+1][0]) {
      |               ~~~~^~~~~~~~~~
reconstruction.cpp:57:13: warning: unused variable 'st' [-Wunused-variable]
   57 |     clock_t st = clock();
      |             ^~
reconstruction.cpp:59:12: warning: unused variable 'j' [-Wunused-variable]
   59 |     int i, j;
      |            ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 280 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 280 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1079 ms 7828 KB Output is correct
21 Correct 1046 ms 7796 KB Output is correct
22 Correct 1032 ms 7924 KB Output is correct
23 Correct 1043 ms 7748 KB Output is correct
24 Correct 1055 ms 7816 KB Output is correct
25 Correct 1064 ms 7748 KB Output is correct
26 Correct 1073 ms 7776 KB Output is correct
27 Correct 1080 ms 7848 KB Output is correct
28 Correct 1073 ms 7888 KB Output is correct
29 Correct 850 ms 7704 KB Output is correct
30 Correct 1086 ms 7752 KB Output is correct
31 Correct 1098 ms 7764 KB Output is correct
32 Correct 1071 ms 8040 KB Output is correct
33 Correct 1069 ms 7868 KB Output is correct
34 Correct 640 ms 7876 KB Output is correct
35 Correct 1066 ms 7892 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1489 ms 28156 KB Output is correct
5 Correct 1471 ms 28184 KB Output is correct
6 Correct 1461 ms 28168 KB Output is correct
7 Correct 1425 ms 30228 KB Output is correct
8 Correct 1446 ms 30388 KB Output is correct
9 Correct 1447 ms 30360 KB Output is correct
10 Correct 1470 ms 28368 KB Output is correct
11 Correct 1427 ms 30368 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 280 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 584 ms 17072 KB Output is correct
21 Correct 576 ms 17104 KB Output is correct
22 Correct 578 ms 17164 KB Output is correct
23 Correct 579 ms 17180 KB Output is correct
24 Correct 579 ms 16992 KB Output is correct
25 Correct 596 ms 16972 KB Output is correct
26 Correct 579 ms 16896 KB Output is correct
27 Correct 575 ms 17020 KB Output is correct
28 Correct 570 ms 16940 KB Output is correct
29 Correct 578 ms 16928 KB Output is correct
30 Correct 576 ms 16972 KB Output is correct
31 Correct 576 ms 17056 KB Output is correct
32 Correct 579 ms 17620 KB Output is correct
33 Correct 577 ms 16804 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 280 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1079 ms 7828 KB Output is correct
21 Correct 1046 ms 7796 KB Output is correct
22 Correct 1032 ms 7924 KB Output is correct
23 Correct 1043 ms 7748 KB Output is correct
24 Correct 1055 ms 7816 KB Output is correct
25 Correct 1064 ms 7748 KB Output is correct
26 Correct 1073 ms 7776 KB Output is correct
27 Correct 1080 ms 7848 KB Output is correct
28 Correct 1073 ms 7888 KB Output is correct
29 Correct 850 ms 7704 KB Output is correct
30 Correct 1086 ms 7752 KB Output is correct
31 Correct 1098 ms 7764 KB Output is correct
32 Correct 1071 ms 8040 KB Output is correct
33 Correct 1069 ms 7868 KB Output is correct
34 Correct 640 ms 7876 KB Output is correct
35 Correct 1066 ms 7892 KB Output is correct
36 Correct 1075 ms 7984 KB Output is correct
37 Correct 1033 ms 8080 KB Output is correct
38 Correct 1036 ms 8152 KB Output is correct
39 Correct 1041 ms 8208 KB Output is correct
40 Correct 1056 ms 7976 KB Output is correct
41 Correct 1058 ms 8076 KB Output is correct
42 Correct 1077 ms 7916 KB Output is correct
43 Correct 1090 ms 8044 KB Output is correct
44 Correct 1068 ms 8148 KB Output is correct
45 Correct 849 ms 8184 KB Output is correct
46 Correct 1084 ms 7920 KB Output is correct
47 Correct 1090 ms 8012 KB Output is correct
48 Correct 1078 ms 8116 KB Output is correct
49 Correct 1076 ms 8004 KB Output is correct
50 Correct 638 ms 8176 KB Output is correct
51 Correct 1082 ms 8056 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 280 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1079 ms 7828 KB Output is correct
21 Correct 1046 ms 7796 KB Output is correct
22 Correct 1032 ms 7924 KB Output is correct
23 Correct 1043 ms 7748 KB Output is correct
24 Correct 1055 ms 7816 KB Output is correct
25 Correct 1064 ms 7748 KB Output is correct
26 Correct 1073 ms 7776 KB Output is correct
27 Correct 1080 ms 7848 KB Output is correct
28 Correct 1073 ms 7888 KB Output is correct
29 Correct 850 ms 7704 KB Output is correct
30 Correct 1086 ms 7752 KB Output is correct
31 Correct 1098 ms 7764 KB Output is correct
32 Correct 1071 ms 8040 KB Output is correct
33 Correct 1069 ms 7868 KB Output is correct
34 Correct 640 ms 7876 KB Output is correct
35 Correct 1066 ms 7892 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1489 ms 28156 KB Output is correct
40 Correct 1471 ms 28184 KB Output is correct
41 Correct 1461 ms 28168 KB Output is correct
42 Correct 1425 ms 30228 KB Output is correct
43 Correct 1446 ms 30388 KB Output is correct
44 Correct 1447 ms 30360 KB Output is correct
45 Correct 1470 ms 28368 KB Output is correct
46 Correct 1427 ms 30368 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 584 ms 17072 KB Output is correct
49 Correct 576 ms 17104 KB Output is correct
50 Correct 578 ms 17164 KB Output is correct
51 Correct 579 ms 17180 KB Output is correct
52 Correct 579 ms 16992 KB Output is correct
53 Correct 596 ms 16972 KB Output is correct
54 Correct 579 ms 16896 KB Output is correct
55 Correct 575 ms 17020 KB Output is correct
56 Correct 570 ms 16940 KB Output is correct
57 Correct 578 ms 16928 KB Output is correct
58 Correct 576 ms 16972 KB Output is correct
59 Correct 576 ms 17056 KB Output is correct
60 Correct 579 ms 17620 KB Output is correct
61 Correct 577 ms 16804 KB Output is correct
62 Correct 1075 ms 7984 KB Output is correct
63 Correct 1033 ms 8080 KB Output is correct
64 Correct 1036 ms 8152 KB Output is correct
65 Correct 1041 ms 8208 KB Output is correct
66 Correct 1056 ms 7976 KB Output is correct
67 Correct 1058 ms 8076 KB Output is correct
68 Correct 1077 ms 7916 KB Output is correct
69 Correct 1090 ms 8044 KB Output is correct
70 Correct 1068 ms 8148 KB Output is correct
71 Correct 849 ms 8184 KB Output is correct
72 Correct 1084 ms 7920 KB Output is correct
73 Correct 1090 ms 8012 KB Output is correct
74 Correct 1078 ms 8116 KB Output is correct
75 Correct 1076 ms 8004 KB Output is correct
76 Correct 638 ms 8176 KB Output is correct
77 Correct 1082 ms 8056 KB Output is correct
78 Correct 1637 ms 27324 KB Output is correct
79 Correct 1588 ms 29452 KB Output is correct
80 Correct 1604 ms 28304 KB Output is correct
81 Correct 1599 ms 28148 KB Output is correct
82 Correct 1603 ms 27228 KB Output is correct
83 Correct 1624 ms 27188 KB Output is correct
84 Correct 1636 ms 27312 KB Output is correct
85 Correct 1637 ms 27264 KB Output is correct
86 Correct 1635 ms 27340 KB Output is correct
87 Correct 1413 ms 28736 KB Output is correct
88 Correct 1640 ms 27208 KB Output is correct
89 Correct 1627 ms 27244 KB Output is correct
90 Correct 1634 ms 27272 KB Output is correct
91 Correct 1641 ms 27192 KB Output is correct
92 Correct 1216 ms 30020 KB Output is correct
93 Correct 1712 ms 28224 KB Output is correct