oj.uz

Submission #729752

# Submission time Handle Problem Language Result Execution time Memory
729752 2023-04-24T13:13:03 Z azberjibiou Reconstruction Project (JOI22_reconstruction) C++17
100 / 100
 3015 ms 34404 KB 
#include <bits/stdc++.h>
#define gibon ios::sync_with_stdio(false); cin.tie(0);
#define bp __builtin_popcount
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pmax pair<ll, ll>
#define all(v) v.begin(), v.end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
using namespace std;
int dx[4]={0, 1, 0, -1}, dy[4]={1, 0, -1 , 0};
const int mxN=520;
const int mxM=100020;
const int mxK=120;
const int mxQ=1000020;
const int MOD=1000000007;
const ll P1=1000000007, P2=10000000009;
const ll INF=8000000000000000001;
typedef struct edge{
    int s, e, w;
}edge;
typedef struct event{
    int t, a, b;
    event() : t(), a(), b() {}
    event(int t, int a, int b) : t(t), a(a), b(b) {}
}event;
int N, M, Q;
edge A[mxM];
pii rng[mxM];
int qry[mxQ];
ll ans[mxQ];
vector <edge> v;
vector <event> tl;
int par[mxN];
void init_uf(){for(int i=1;i<=N;i++)   par[i]=i;}
void input()
{
    cin >> N >> M;
    for(int i=0;i<M;i++)   cin >> A[i].s >> A[i].e >> A[i].w;
    sort(A, A+M, [](edge a, edge b){return a.w<b.w;});
    cin >> Q;
    for(int i=0;i<Q;i++)   cin >> qry[i];
}
int findpar(int a){return par[a]==a ? a : par[a]=findpar(par[a]);}
void onion(int a, int b){int p=findpar(a), q=findpar(b);    par[p]=q;}
int main()
{
    gibon
    input();
    for(int i=0;i<M;i++)
    {
        init_uf();
        assert((int)v.size()<=N);
        for(int j=(int)v.size()-1;j>=0;j--)
        {
            onion(v[j].s, v[j].e);
            if(findpar(A[i].s)==findpar(A[i].e))
            {
                rng[i].fi=(v[j].w+A[i].w+2)/2;
                break;
            }
        }
        v.push_back(A[i]);
        init_uf();
        for(int j=v.size()-1;j>=0;j--)
        {
            if(findpar(v[j].s)==findpar(v[j].e))
            {
                v.erase(v.begin()+j);
                break;
            }
            onion(v[j].s, v[j].e);
        }
    }
    v.clear();
    for(int i=M-1;i>=0;i--)
    {
        rng[i].se=MOD;
        init_uf();
        for(int j=(int)v.size()-1;j>=0;j--)
        {
            onion(v[j].s, v[j].e);
            if(findpar(A[i].s)==findpar(A[i].e))
            {
                rng[i].se=(v[j].w+A[i].w)/2;
                break;
            }
        }
        v.push_back(A[i]);
        init_uf();
        for(int j=v.size()-1;j>=0;j--)
        {
            if(findpar(v[j].s)==findpar(v[j].e))
            {
                v.erase(v.begin()+j);
                break;
            }
            onion(v[j].s, v[j].e);
        }
    }
    for(int i=0;i<M;i++)
    {
        tl.emplace_back(rng[i].fi, -1, A[i].w);
        tl.emplace_back(A[i].w, 2, -2*A[i].w);
        tl.emplace_back(rng[i].se+1, -1, A[i].w);
    }
    sort(all(tl), [](event a, event b){return a.t<b.t;});
    int it=0;
    pll nv=pll(0, 0);
    for(int i=0;i<Q;i++)
    {
        while(it<tl.size() && tl[it].t<=qry[i])    nv.fi+=tl[it].a, nv.se+=tl[it++].b;
        cout << nv.fi*qry[i]+nv.se << '\n';
    }
}

Compilation message

reconstruction.cpp: In function 'int main()':
reconstruction.cpp:116:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<event>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |         while(it<tl.size() && tl[it].t<=qry[i])    nv.fi+=tl[it].a, nv.se+=tl[it++].b;
      |               ~~^~~~~~~~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2983 ms 8940 KB Output is correct
21 Correct 1110 ms 10256 KB Output is correct
22 Correct 1158 ms 10340 KB Output is correct
23 Correct 1296 ms 10192 KB Output is correct
24 Correct 2003 ms 10308 KB Output is correct
25 Correct 2841 ms 10256 KB Output is correct
26 Correct 2927 ms 10316 KB Output is correct
27 Correct 2902 ms 10264 KB Output is correct
28 Correct 2979 ms 10252 KB Output is correct
29 Correct 2943 ms 10260 KB Output is correct
30 Correct 2945 ms 10260 KB Output is correct
31 Correct 2906 ms 10252 KB Output is correct
32 Correct 2863 ms 10248 KB Output is correct
33 Correct 2913 ms 10256 KB Output is correct
34 Correct 2801 ms 10392 KB Output is correct
35 Correct 2878 ms 10264 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 1 ms 324 KB Output is correct
4 Correct 1333 ms 21284 KB Output is correct
5 Correct 1349 ms 32256 KB Output is correct
6 Correct 1290 ms 32296 KB Output is correct
7 Correct 442 ms 34188 KB Output is correct
8 Correct 318 ms 34204 KB Output is correct
9 Correct 320 ms 34404 KB Output is correct
10 Correct 1350 ms 32396 KB Output is correct
11 Correct 330 ms 34396 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 186 ms 16972 KB Output is correct
21 Correct 178 ms 16872 KB Output is correct
22 Correct 195 ms 16792 KB Output is correct
23 Correct 188 ms 16844 KB Output is correct
24 Correct 186 ms 16860 KB Output is correct
25 Correct 203 ms 17100 KB Output is correct
26 Correct 200 ms 17100 KB Output is correct
27 Correct 189 ms 17096 KB Output is correct
28 Correct 187 ms 17068 KB Output is correct
29 Correct 220 ms 17020 KB Output is correct
30 Correct 208 ms 17132 KB Output is correct
31 Correct 200 ms 17068 KB Output is correct
32 Correct 192 ms 17708 KB Output is correct
33 Correct 195 ms 16984 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2983 ms 8940 KB Output is correct
21 Correct 1110 ms 10256 KB Output is correct
22 Correct 1158 ms 10340 KB Output is correct
23 Correct 1296 ms 10192 KB Output is correct
24 Correct 2003 ms 10308 KB Output is correct
25 Correct 2841 ms 10256 KB Output is correct
26 Correct 2927 ms 10316 KB Output is correct
27 Correct 2902 ms 10264 KB Output is correct
28 Correct 2979 ms 10252 KB Output is correct
29 Correct 2943 ms 10260 KB Output is correct
30 Correct 2945 ms 10260 KB Output is correct
31 Correct 2906 ms 10252 KB Output is correct
32 Correct 2863 ms 10248 KB Output is correct
33 Correct 2913 ms 10256 KB Output is correct
34 Correct 2801 ms 10392 KB Output is correct
35 Correct 2878 ms 10264 KB Output is correct
36 Correct 2935 ms 10524 KB Output is correct
37 Correct 1018 ms 10688 KB Output is correct
38 Correct 1038 ms 10540 KB Output is correct
39 Correct 1304 ms 10616 KB Output is correct
40 Correct 1886 ms 10644 KB Output is correct
41 Correct 2735 ms 10612 KB Output is correct
42 Correct 2823 ms 10560 KB Output is correct
43 Correct 2799 ms 10472 KB Output is correct
44 Correct 2792 ms 10588 KB Output is correct
45 Correct 2795 ms 10604 KB Output is correct
46 Correct 2814 ms 10656 KB Output is correct
47 Correct 2815 ms 10616 KB Output is correct
48 Correct 2803 ms 10600 KB Output is correct
49 Correct 2806 ms 10600 KB Output is correct
50 Correct 2797 ms 10628 KB Output is correct
51 Correct 2803 ms 10560 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2983 ms 8940 KB Output is correct
21 Correct 1110 ms 10256 KB Output is correct
22 Correct 1158 ms 10340 KB Output is correct
23 Correct 1296 ms 10192 KB Output is correct
24 Correct 2003 ms 10308 KB Output is correct
25 Correct 2841 ms 10256 KB Output is correct
26 Correct 2927 ms 10316 KB Output is correct
27 Correct 2902 ms 10264 KB Output is correct
28 Correct 2979 ms 10252 KB Output is correct
29 Correct 2943 ms 10260 KB Output is correct
30 Correct 2945 ms 10260 KB Output is correct
31 Correct 2906 ms 10252 KB Output is correct
32 Correct 2863 ms 10248 KB Output is correct
33 Correct 2913 ms 10256 KB Output is correct
34 Correct 2801 ms 10392 KB Output is correct
35 Correct 2878 ms 10264 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 324 KB Output is correct
39 Correct 1333 ms 21284 KB Output is correct
40 Correct 1349 ms 32256 KB Output is correct
41 Correct 1290 ms 32296 KB Output is correct
42 Correct 442 ms 34188 KB Output is correct
43 Correct 318 ms 34204 KB Output is correct
44 Correct 320 ms 34404 KB Output is correct
45 Correct 1350 ms 32396 KB Output is correct
46 Correct 330 ms 34396 KB Output is correct
47 Correct 1 ms 328 KB Output is correct
48 Correct 186 ms 16972 KB Output is correct
49 Correct 178 ms 16872 KB Output is correct
50 Correct 195 ms 16792 KB Output is correct
51 Correct 188 ms 16844 KB Output is correct
52 Correct 186 ms 16860 KB Output is correct
53 Correct 203 ms 17100 KB Output is correct
54 Correct 200 ms 17100 KB Output is correct
55 Correct 189 ms 17096 KB Output is correct
56 Correct 187 ms 17068 KB Output is correct
57 Correct 220 ms 17020 KB Output is correct
58 Correct 208 ms 17132 KB Output is correct
59 Correct 200 ms 17068 KB Output is correct
60 Correct 192 ms 17708 KB Output is correct
61 Correct 195 ms 16984 KB Output is correct
62 Correct 2935 ms 10524 KB Output is correct
63 Correct 1018 ms 10688 KB Output is correct
64 Correct 1038 ms 10540 KB Output is correct
65 Correct 1304 ms 10616 KB Output is correct
66 Correct 1886 ms 10644 KB Output is correct
67 Correct 2735 ms 10612 KB Output is correct
68 Correct 2823 ms 10560 KB Output is correct
69 Correct 2799 ms 10472 KB Output is correct
70 Correct 2792 ms 10588 KB Output is correct
71 Correct 2795 ms 10604 KB Output is correct
72 Correct 2814 ms 10656 KB Output is correct
73 Correct 2815 ms 10616 KB Output is correct
74 Correct 2803 ms 10600 KB Output is correct
75 Correct 2806 ms 10600 KB Output is correct
76 Correct 2797 ms 10628 KB Output is correct
77 Correct 2803 ms 10560 KB Output is correct
78 Correct 2968 ms 31224 KB Output is correct
79 Correct 1176 ms 33324 KB Output is correct
80 Correct 1230 ms 32304 KB Output is correct
81 Correct 1432 ms 32328 KB Output is correct
82 Correct 2092 ms 31464 KB Output is correct
83 Correct 2903 ms 31460 KB Output is correct
84 Correct 2958 ms 31308 KB Output is correct
85 Correct 3015 ms 31220 KB Output is correct
86 Correct 2971 ms 31280 KB Output is correct
87 Correct 2954 ms 32804 KB Output is correct
88 Correct 2959 ms 31452 KB Output is correct
89 Correct 2997 ms 31476 KB Output is correct
90 Correct 2953 ms 31540 KB Output is correct
91 Correct 2965 ms 31072 KB Output is correct
92 Correct 2951 ms 34148 KB Output is correct
93 Correct 3005 ms 32292 KB Output is correct