oj.uz

Submission #567724

# Submission time Handle Problem Language Result Execution time Memory
567724 2022-05-24T05:52:03 Z zaneyu Team Contest (JOI22_team) C++14
100 / 100
 1223 ms 73436 KB 
/*input
8
1 1 1
1 1 5
1 5 1
5 1 1
1 5 5
5 1 5
5 5 1
5 5 5
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef unsigned long long int ll;

#define ld long double
#define pii pair<ll,ll>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())+1
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
ll mult(ll a,ll b){
    if(a<0) a+=MOD;
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
map<pii,vector<int>> mp[3];
multiset<int> ms[3];
int mx[3];
int arr[maxn][3];
bool del[maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n;
    cin>>n;
    REP(i,n){
        REP(j,3){
            cin>>arr[i][j];
            ms[j].insert(arr[i][j]);
        }
        int c=0;
        REP(a,3) REP(b,a) mp[c++][{arr[i][a],arr[i][b]}].pb(i);
    }
    REP(i,n){
        if(!sz(ms[0])) break;
        REP(j,3) mx[j]=(*ms[j].rbegin());
        set<int> ss;
        int c=0;
        REP(a,3) REP(b,a){
            for(auto z:mp[c][{mx[a],mx[b]}]){
                ss.insert(z);
            }
            mp[c][{mx[a],mx[b]}].clear();
            ++c;
        }
        for(int a:ss){
            if(del[a]) continue;
            del[a]=1;
            REP(j,3) ms[j].erase(ms[j].find(arr[a][j]));
        }
    }
    REP(j,3) mx[j]=0;
    REP(j,n){
        if(del[j]) continue;
        REP(k,3) MXTO(mx[k],arr[j][k]);
    }
    if(!mx[0]) cout<<-1;
    else cout<<mx[0]+mx[1]+mx[2];
}

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 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 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 340 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 328 KB Output is correct
21 Correct 1 ms 340 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 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 8 ms 2260 KB Output is correct
27 Correct 10 ms 2260 KB Output is correct
28 Correct 10 ms 2384 KB Output is correct
29 Correct 13 ms 2260 KB Output is correct
30 Correct 8 ms 1620 KB Output is correct
31 Correct 10 ms 2284 KB Output is correct
32 Correct 10 ms 1896 KB Output is correct
33 Correct 6 ms 1748 KB Output is correct
34 Correct 8 ms 2260 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 2 ms 596 KB Output is correct
37 Correct 6 ms 1748 KB Output is correct
38 Correct 7 ms 1876 KB Output is correct
39 Correct 3 ms 724 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 238 ms 26168 KB Output is correct
12 Correct 206 ms 17656 KB Output is correct
13 Correct 151 ms 21180 KB Output is correct
14 Correct 266 ms 27000 KB Output is correct
15 Correct 223 ms 32444 KB Output is correct
16 Correct 212 ms 32436 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 238 ms 26168 KB Output is correct
12 Correct 206 ms 17656 KB Output is correct
13 Correct 151 ms 21180 KB Output is correct
14 Correct 266 ms 27000 KB Output is correct
15 Correct 223 ms 32444 KB Output is correct
16 Correct 212 ms 32436 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 317 ms 26344 KB Output is correct
23 Correct 314 ms 25292 KB Output is correct
24 Correct 236 ms 19376 KB Output is correct
25 Correct 348 ms 26384 KB Output is correct
26 Correct 242 ms 32536 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 238 ms 26168 KB Output is correct
12 Correct 206 ms 17656 KB Output is correct
13 Correct 151 ms 21180 KB Output is correct
14 Correct 266 ms 27000 KB Output is correct
15 Correct 223 ms 32444 KB Output is correct
16 Correct 212 ms 32436 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 317 ms 26344 KB Output is correct
23 Correct 314 ms 25292 KB Output is correct
24 Correct 236 ms 19376 KB Output is correct
25 Correct 348 ms 26384 KB Output is correct
26 Correct 242 ms 32536 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 324 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 9 ms 1904 KB Output is correct
32 Correct 2 ms 596 KB Output is correct
33 Correct 2 ms 588 KB Output is correct
34 Correct 821 ms 46036 KB Output is correct
35 Correct 840 ms 39316 KB Output is correct
36 Correct 836 ms 39836 KB Output is correct
37 Correct 805 ms 38788 KB Output is correct
38 Correct 294 ms 32336 KB Output is correct
39 Correct 207 ms 25548 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 238 ms 26168 KB Output is correct
12 Correct 206 ms 17656 KB Output is correct
13 Correct 151 ms 21180 KB Output is correct
14 Correct 266 ms 27000 KB Output is correct
15 Correct 223 ms 32444 KB Output is correct
16 Correct 212 ms 32436 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 317 ms 26344 KB Output is correct
23 Correct 314 ms 25292 KB Output is correct
24 Correct 236 ms 19376 KB Output is correct
25 Correct 348 ms 26384 KB Output is correct
26 Correct 242 ms 32536 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 324 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 9 ms 1904 KB Output is correct
32 Correct 2 ms 596 KB Output is correct
33 Correct 2 ms 588 KB Output is correct
34 Correct 821 ms 46036 KB Output is correct
35 Correct 840 ms 39316 KB Output is correct
36 Correct 836 ms 39836 KB Output is correct
37 Correct 805 ms 38788 KB Output is correct
38 Correct 294 ms 32336 KB Output is correct
39 Correct 207 ms 25548 KB Output is correct
40 Correct 8 ms 1676 KB Output is correct
41 Correct 9 ms 2328 KB Output is correct
42 Correct 6 ms 1752 KB Output is correct
43 Correct 10 ms 1876 KB Output is correct
44 Correct 1145 ms 72564 KB Output is correct
45 Correct 1184 ms 59448 KB Output is correct
46 Correct 1223 ms 64380 KB Output is correct
47 Correct 1110 ms 58760 KB Output is correct
48 Correct 459 ms 34852 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 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 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 340 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 328 KB Output is correct
21 Correct 1 ms 340 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 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 8 ms 2260 KB Output is correct
27 Correct 10 ms 2260 KB Output is correct
28 Correct 10 ms 2384 KB Output is correct
29 Correct 13 ms 2260 KB Output is correct
30 Correct 8 ms 1620 KB Output is correct
31 Correct 10 ms 2284 KB Output is correct
32 Correct 10 ms 1896 KB Output is correct
33 Correct 6 ms 1748 KB Output is correct
34 Correct 8 ms 2260 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 2 ms 596 KB Output is correct
37 Correct 6 ms 1748 KB Output is correct
38 Correct 7 ms 1876 KB Output is correct
39 Correct 3 ms 724 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 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 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 238 ms 26168 KB Output is correct
51 Correct 206 ms 17656 KB Output is correct
52 Correct 151 ms 21180 KB Output is correct
53 Correct 266 ms 27000 KB Output is correct
54 Correct 223 ms 32444 KB Output is correct
55 Correct 212 ms 32436 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 3 ms 724 KB Output is correct
61 Correct 317 ms 26344 KB Output is correct
62 Correct 314 ms 25292 KB Output is correct
63 Correct 236 ms 19376 KB Output is correct
64 Correct 348 ms 26384 KB Output is correct
65 Correct 242 ms 32536 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 324 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 9 ms 1904 KB Output is correct
71 Correct 2 ms 596 KB Output is correct
72 Correct 2 ms 588 KB Output is correct
73 Correct 821 ms 46036 KB Output is correct
74 Correct 840 ms 39316 KB Output is correct
75 Correct 836 ms 39836 KB Output is correct
76 Correct 805 ms 38788 KB Output is correct
77 Correct 294 ms 32336 KB Output is correct
78 Correct 207 ms 25548 KB Output is correct
79 Correct 8 ms 1676 KB Output is correct
80 Correct 9 ms 2328 KB Output is correct
81 Correct 6 ms 1752 KB Output is correct
82 Correct 10 ms 1876 KB Output is correct
83 Correct 1145 ms 72564 KB Output is correct
84 Correct 1184 ms 59448 KB Output is correct
85 Correct 1223 ms 64380 KB Output is correct
86 Correct 1110 ms 58760 KB Output is correct
87 Correct 459 ms 34852 KB Output is correct
88 Correct 860 ms 73292 KB Output is correct
89 Correct 1063 ms 71456 KB Output is correct
90 Correct 915 ms 73216 KB Output is correct
91 Correct 1076 ms 70116 KB Output is correct
92 Correct 1006 ms 71976 KB Output is correct
93 Correct 1162 ms 71592 KB Output is correct
94 Correct 1101 ms 68288 KB Output is correct
95 Correct 518 ms 56640 KB Output is correct
96 Correct 529 ms 73436 KB Output is correct
97 Correct 250 ms 32976 KB Output is correct
98 Correct 310 ms 56904 KB Output is correct
99 Correct 353 ms 57156 KB Output is correct