oj.uz

Submission #677732

# Submission time Handle Problem Language Result Execution time Memory
677732 2023-01-04T09:00:19 Z DwightKSchrute Team Contest (JOI22_team) C++17
100 / 100
 1881 ms 125208 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map


template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}



void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}
void solve() {
    int n;
    cin >> n;
    vvi a(n,vi(3));
    for(int i=0; i<n; i++)
        read(a[i]);

    multiset<int>X,Y,Z;
    map<pi,int>xy,yz,xz;
    map<pi,multiset<int>>xy_to_z,xz_to_y,yz_to_x;

    for(int i=0; i<n; i++){
        int x=a[i][0],y=a[i][1],z=a[i][2];
        xy[{x,y}]++;
        xz[{x,z}]++;
        yz[{y,z}]++;
        X.insert(x);
        Y.insert(y);
        Z.insert(z);

        xy_to_z[{x,y}].insert(z);
        xz_to_y[{x,z}].insert(y);
        yz_to_x[{y,z}].insert(x);
    }

    while(X.size()){
        int x=*X.rbegin(),y=*Y.rbegin(),z=*Z.rbegin();
        if(xy[{x,y}])
            z = *xy_to_z[{x,y}].begin();
        else if(yz[{y,z}])
            x  = *yz_to_x[{y,z}].begin();
        else if(xz[{x,z}])
            y = *xz_to_y[{x,z}].begin();
        else
            break;

        Z.erase(Z.find(z));
        X.erase(X.find(x));
        Y.erase(Y.find(y));

        xy_to_z[{x,y}].erase(xy_to_z[{x,y}].find(z));
        xz_to_y[{x,z}].erase(xz_to_y[{x,z}].find(y));
        yz_to_x[{y,z}].erase(yz_to_x[{y,z}].find(x));

        xy[{x,y}]--;
        xz[{x,z}]--;
        yz[{y,z}]--;
    }

    if(X.size())out(*X.rbegin()+*Y.rbegin()+*Z.rbegin())
    else out(-1)
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 244 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 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 340 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 244 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 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 340 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 16 ms 3572 KB Output is correct
27 Correct 13 ms 3432 KB Output is correct
28 Correct 14 ms 3448 KB Output is correct
29 Correct 24 ms 3396 KB Output is correct
30 Correct 10 ms 2388 KB Output is correct
31 Correct 15 ms 3540 KB Output is correct
32 Correct 16 ms 2900 KB Output is correct
33 Correct 12 ms 2516 KB Output is correct
34 Correct 13 ms 3412 KB Output is correct
35 Correct 2 ms 852 KB Output is correct
36 Correct 2 ms 852 KB Output is correct
37 Correct 7 ms 2900 KB Output is correct
38 Correct 11 ms 2900 KB Output is correct
39 Correct 4 ms 1108 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 454 ms 50776 KB Output is correct
12 Correct 272 ms 33928 KB Output is correct
13 Correct 236 ms 41868 KB Output is correct
14 Correct 438 ms 50764 KB Output is correct
15 Correct 344 ms 50764 KB Output is correct
16 Correct 266 ms 50780 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 454 ms 50776 KB Output is correct
12 Correct 272 ms 33928 KB Output is correct
13 Correct 236 ms 41868 KB Output is correct
14 Correct 438 ms 50764 KB Output is correct
15 Correct 344 ms 50764 KB Output is correct
16 Correct 266 ms 50780 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 4 ms 1108 KB Output is correct
22 Correct 636 ms 51028 KB Output is correct
23 Correct 570 ms 49748 KB Output is correct
24 Correct 412 ms 36952 KB Output is correct
25 Correct 639 ms 50780 KB Output is correct
26 Correct 361 ms 50804 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 454 ms 50776 KB Output is correct
12 Correct 272 ms 33928 KB Output is correct
13 Correct 236 ms 41868 KB Output is correct
14 Correct 438 ms 50764 KB Output is correct
15 Correct 344 ms 50764 KB Output is correct
16 Correct 266 ms 50780 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 4 ms 1108 KB Output is correct
22 Correct 636 ms 51028 KB Output is correct
23 Correct 570 ms 49748 KB Output is correct
24 Correct 412 ms 36952 KB Output is correct
25 Correct 639 ms 50780 KB Output is correct
26 Correct 361 ms 50804 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 16 ms 2900 KB Output is correct
32 Correct 2 ms 852 KB Output is correct
33 Correct 2 ms 852 KB Output is correct
34 Correct 1169 ms 82016 KB Output is correct
35 Correct 1083 ms 70872 KB Output is correct
36 Correct 1214 ms 74188 KB Output is correct
37 Correct 1384 ms 72232 KB Output is correct
38 Correct 459 ms 51348 KB Output is correct
39 Correct 294 ms 45676 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 454 ms 50776 KB Output is correct
12 Correct 272 ms 33928 KB Output is correct
13 Correct 236 ms 41868 KB Output is correct
14 Correct 438 ms 50764 KB Output is correct
15 Correct 344 ms 50764 KB Output is correct
16 Correct 266 ms 50780 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 4 ms 1108 KB Output is correct
22 Correct 636 ms 51028 KB Output is correct
23 Correct 570 ms 49748 KB Output is correct
24 Correct 412 ms 36952 KB Output is correct
25 Correct 639 ms 50780 KB Output is correct
26 Correct 361 ms 50804 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 16 ms 2900 KB Output is correct
32 Correct 2 ms 852 KB Output is correct
33 Correct 2 ms 852 KB Output is correct
34 Correct 1169 ms 82016 KB Output is correct
35 Correct 1083 ms 70872 KB Output is correct
36 Correct 1214 ms 74188 KB Output is correct
37 Correct 1384 ms 72232 KB Output is correct
38 Correct 459 ms 51348 KB Output is correct
39 Correct 294 ms 45676 KB Output is correct
40 Correct 10 ms 2528 KB Output is correct
41 Correct 12 ms 3540 KB Output is correct
42 Correct 9 ms 2872 KB Output is correct
43 Correct 11 ms 2900 KB Output is correct
44 Correct 1404 ms 122872 KB Output is correct
45 Correct 1713 ms 103128 KB Output is correct
46 Correct 1710 ms 109820 KB Output is correct
47 Correct 1881 ms 101448 KB Output is correct
48 Correct 617 ms 54848 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 244 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 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 340 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 16 ms 3572 KB Output is correct
27 Correct 13 ms 3432 KB Output is correct
28 Correct 14 ms 3448 KB Output is correct
29 Correct 24 ms 3396 KB Output is correct
30 Correct 10 ms 2388 KB Output is correct
31 Correct 15 ms 3540 KB Output is correct
32 Correct 16 ms 2900 KB Output is correct
33 Correct 12 ms 2516 KB Output is correct
34 Correct 13 ms 3412 KB Output is correct
35 Correct 2 ms 852 KB Output is correct
36 Correct 2 ms 852 KB Output is correct
37 Correct 7 ms 2900 KB Output is correct
38 Correct 11 ms 2900 KB Output is correct
39 Correct 4 ms 1108 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 454 ms 50776 KB Output is correct
51 Correct 272 ms 33928 KB Output is correct
52 Correct 236 ms 41868 KB Output is correct
53 Correct 438 ms 50764 KB Output is correct
54 Correct 344 ms 50764 KB Output is correct
55 Correct 266 ms 50780 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 4 ms 1108 KB Output is correct
61 Correct 636 ms 51028 KB Output is correct
62 Correct 570 ms 49748 KB Output is correct
63 Correct 412 ms 36952 KB Output is correct
64 Correct 639 ms 50780 KB Output is correct
65 Correct 361 ms 50804 KB Output is correct
66 Correct 1 ms 468 KB Output is correct
67 Correct 1 ms 468 KB Output is correct
68 Correct 1 ms 468 KB Output is correct
69 Correct 1 ms 468 KB Output is correct
70 Correct 16 ms 2900 KB Output is correct
71 Correct 2 ms 852 KB Output is correct
72 Correct 2 ms 852 KB Output is correct
73 Correct 1169 ms 82016 KB Output is correct
74 Correct 1083 ms 70872 KB Output is correct
75 Correct 1214 ms 74188 KB Output is correct
76 Correct 1384 ms 72232 KB Output is correct
77 Correct 459 ms 51348 KB Output is correct
78 Correct 294 ms 45676 KB Output is correct
79 Correct 10 ms 2528 KB Output is correct
80 Correct 12 ms 3540 KB Output is correct
81 Correct 9 ms 2872 KB Output is correct
82 Correct 11 ms 2900 KB Output is correct
83 Correct 1404 ms 122872 KB Output is correct
84 Correct 1713 ms 103128 KB Output is correct
85 Correct 1710 ms 109820 KB Output is correct
86 Correct 1881 ms 101448 KB Output is correct
87 Correct 617 ms 54848 KB Output is correct
88 Correct 1024 ms 125208 KB Output is correct
89 Correct 1320 ms 122248 KB Output is correct
90 Correct 1143 ms 124720 KB Output is correct
91 Correct 1534 ms 120180 KB Output is correct
92 Correct 1295 ms 121604 KB Output is correct
93 Correct 1551 ms 121376 KB Output is correct
94 Correct 1600 ms 116240 KB Output is correct
95 Correct 785 ms 89560 KB Output is correct
96 Correct 718 ms 125132 KB Output is correct
97 Correct 296 ms 54856 KB Output is correct
98 Correct 420 ms 100272 KB Output is correct
99 Correct 576 ms 100412 KB Output is correct