oj.uz

Submission #905117

# Submission time Handle Problem Language Result Execution time Memory
905117 2024-01-12T15:32:50 Z Ahmed57 Reconstruction Project (JOI22_reconstruction) C++17
14 / 100
 1593 ms 58180 KB 
//#include "dango3.h"

#include <bits/stdc++.h>
using namespace std;
#define int long long
int pr[501],gs[501];
int find(int x){
    if(x==pr[x])return x;
    return pr[x] = find(pr[x]);
}
bool mergegroup(int a,int b){
    a = find(a);b = find(b);
    if(a==b)return 0;
    if(gs[a]<gs[b])swap(a,b);
    pr[b] = a;
    gs[a]+=gs[b];
    return 1;
}
signed main(){
    //freopen("input.txt","r",stdin);
    //freopen("outout.txt","w",stdout);
    int n,m;
    cin>>n>>m;
    vector<int> v[n];
    int cool[n];
    long long smaller =0 , greater = 0;
    long long cntsm = 0 , cntlr = 0;
    vector<array<int,3>> ed;
    for(int i = 0;i<m;i++){
        int a,b,c;
        cin>>a>>b>>c;
        ed.push_back({a,b,c});
        v[a].push_back(c);
    }
    vector<pair<int,int>> pts;
    for(int i = 1;i<n;i++){
        sort(v[i].begin(),v[i].end());
        pts.push_back({0,i});
        for(int j = 0;j<v[i].size();j++){
            pts.push_back({v[i][j]+1,i});
            pts.push_back({v[i][j],i});
        }
        for(int j = 1;j<v[i].size();j++){
            pts.push_back({(v[i][j]+v[i][j-1])/2+1,i});
            pts.push_back({(v[i][j]+v[i][j-1])/2,i});
        }
        cool[i] = 0;
    }
    sort(pts.begin(),pts.end());
    int q;
    cin>>q;
    if(q<=10){
        while(q--){
        int c;
        cin>>c;
        vector<array<int,3>> lol;
        for(int i = 1;i<=n;i++){
            pr[i] = i , gs[i] = 1;
        }
        for(int i = 0;i<m;i++){
            lol.push_back({abs(ed[i][2]-c),ed[i][0],ed[i][1]});
        }
        sort(lol.begin(),lol.end());
        long long all = 0;
        for(auto i:lol){
            if(mergegroup(i[1],i[2])){
                all+=i[0];
            }
        }
        cout<<all<<endl;
    }
    return 0;
    }
    long long ans[q];
    vector<pair<int,int>> qu;
    for(int i = 0;i<q;i++){
        int c;cin>>c;
        qu.push_back({c,i});
    }
    sort(qu.begin(),qu.end());
    int ind = 0;
    for(auto i:qu){
        while(ind<pts.size()&&pts[ind].first<=i.first){
            int an = pts[ind].second;
            if(cool[an]!=0){
                if(cool[an]>0){
                    greater-=cool[an];
                    cntlr--;
                }else{
                    smaller+=cool[an];
                    cntsm--;
                }
            }
            int it = lower_bound(v[an].begin(),v[an].end(),i.first)-v[an].begin();
            if(it==v[an].size()){
                it--;
                cool[an] = -v[an][it];
                smaller+=v[an][it];
                cntsm++;
            }else if(it==0){
                cool[an] = v[an][it];
                greater+=v[an][it];
                cntlr++;
            }else{
                if(abs(v[an][it]-i.first)<=abs(v[an][it-1]-i.first)){
                    cool[an] = v[an][it];
                    greater+=v[an][it];
                    cntlr++;
                }else{
                    it--;
                    cool[an] = -v[an][it];
                    smaller+=v[an][it];
                    cntsm++;
                }
            }
            ind++;
        }
        ans[i.second] = greater-smaller-i.first*cntlr+i.first*cntsm;
    }
    for(int i = 0;i<q;i++){
        cout<<ans[i]<<endl;
    }
}

Compilation message

reconstruction.cpp: In function 'int main()':
reconstruction.cpp:39:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for(int j = 0;j<v[i].size();j++){
      |                       ~^~~~~~~~~~~~
reconstruction.cpp:43:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for(int j = 1;j<v[i].size();j++){
      |                       ~^~~~~~~~~~~~
reconstruction.cpp:83:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |         while(ind<pts.size()&&pts[ind].first<=i.first){
      |               ~~~^~~~~~~~~~~
reconstruction.cpp:95:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |             if(it==v[an].size()){
      |                ~~^~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 420 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 428 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 201 ms 19148 KB Output is correct
21 Correct 193 ms 18884 KB Output is correct
22 Correct 191 ms 18156 KB Output is correct
23 Correct 200 ms 19060 KB Output is correct
24 Correct 197 ms 19520 KB Output is correct
25 Correct 196 ms 19160 KB Output is correct
26 Correct 199 ms 17604 KB Output is correct
27 Correct 200 ms 17652 KB Output is correct
28 Correct 224 ms 18108 KB Output is correct
29 Correct 234 ms 18060 KB Output is correct
30 Correct 195 ms 17452 KB Output is correct
31 Correct 192 ms 18924 KB Output is correct
32 Correct 194 ms 18672 KB Output is correct
33 Correct 191 ms 18348 KB Output is correct
34 Correct 227 ms 19188 KB Output is correct
35 Correct 191 ms 18952 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1560 ms 47152 KB Output is correct
5 Correct 1547 ms 45852 KB Output is correct
6 Correct 1553 ms 45784 KB Output is correct
7 Correct 1566 ms 47120 KB Output is correct
8 Correct 1566 ms 57640 KB Output is correct
9 Correct 1593 ms 55600 KB Output is correct
10 Correct 1537 ms 45696 KB Output is correct
11 Correct 1519 ms 54768 KB Output is correct

Subtask #4
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 420 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 428 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Runtime error 331 ms 58180 KB Execution killed with signal 11
21 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 420 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 428 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 201 ms 19148 KB Output is correct
21 Correct 193 ms 18884 KB Output is correct
22 Correct 191 ms 18156 KB Output is correct
23 Correct 200 ms 19060 KB Output is correct
24 Correct 197 ms 19520 KB Output is correct
25 Correct 196 ms 19160 KB Output is correct
26 Correct 199 ms 17604 KB Output is correct
27 Correct 200 ms 17652 KB Output is correct
28 Correct 224 ms 18108 KB Output is correct
29 Correct 234 ms 18060 KB Output is correct
30 Correct 195 ms 17452 KB Output is correct
31 Correct 192 ms 18924 KB Output is correct
32 Correct 194 ms 18672 KB Output is correct
33 Correct 191 ms 18348 KB Output is correct
34 Correct 227 ms 19188 KB Output is correct
35 Correct 191 ms 18952 KB Output is correct
36 Incorrect 139 ms 17656 KB Output isn't correct
37 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 420 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 428 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 201 ms 19148 KB Output is correct
21 Correct 193 ms 18884 KB Output is correct
22 Correct 191 ms 18156 KB Output is correct
23 Correct 200 ms 19060 KB Output is correct
24 Correct 197 ms 19520 KB Output is correct
25 Correct 196 ms 19160 KB Output is correct
26 Correct 199 ms 17604 KB Output is correct
27 Correct 200 ms 17652 KB Output is correct
28 Correct 224 ms 18108 KB Output is correct
29 Correct 234 ms 18060 KB Output is correct
30 Correct 195 ms 17452 KB Output is correct
31 Correct 192 ms 18924 KB Output is correct
32 Correct 194 ms 18672 KB Output is correct
33 Correct 191 ms 18348 KB Output is correct
34 Correct 227 ms 19188 KB Output is correct
35 Correct 191 ms 18952 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1560 ms 47152 KB Output is correct
40 Correct 1547 ms 45852 KB Output is correct
41 Correct 1553 ms 45784 KB Output is correct
42 Correct 1566 ms 47120 KB Output is correct
43 Correct 1566 ms 57640 KB Output is correct
44 Correct 1593 ms 55600 KB Output is correct
45 Correct 1537 ms 45696 KB Output is correct
46 Correct 1519 ms 54768 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Runtime error 331 ms 58180 KB Execution killed with signal 11
49 Halted 0 ms 0 KB -