oj.uz

Submission #677725

# Submission time Handle Problem Language Result Execution time Memory
677725 2023-01-04T08:47:01 Z DwightKSchrute Team Contest (JOI22_team) C++17
55 / 100
 2000 ms 27760 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]);

    sort(all(a));
    a=UNQ(a);
    n=a.size();
    
    while(1){
        int max_x=0,max_y=0,max_z=0;
        for(int i=0; i<n; i++){
            max_x = max(max_x,a[i][0]);
            max_y = max(max_y,a[i][1]);
            max_z = max(max_z,a[i][2]);
        }
        bool ok=1;
        for(int i=0; i<n; i++){
            int gr=0;
            if(a[i][0]==max_x)
                gr++;
            if(a[i][1]==max_y)
                gr++;
            if(a[i][2]==max_z)
                gr++;
            if(gr<=1)
                continue;
            a.erase(a.begin()+i);
            n--;
            ok=0;
            break;
        }
        if(ok)
            break;
    }
    if(!n)out(-1)


    int max_x=0,max_y=0,max_z=0;
    for(int i=0; i<n; i++){
        max_x = max(max_x,a[i][0]);
        max_y = max(max_y,a[i][1]);
        max_z = max(max_z,a[i][2]);
    }
    out(max_x+max_y+max_z)
}

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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 320 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 1 ms 320 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 316 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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 320 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 1 ms 320 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 3 ms 980 KB Output is correct
27 Correct 11 ms 980 KB Output is correct
28 Correct 17 ms 1088 KB Output is correct
29 Correct 26 ms 1080 KB Output is correct
30 Correct 13 ms 724 KB Output is correct
31 Correct 8 ms 1036 KB Output is correct
32 Correct 24 ms 980 KB Output is correct
33 Correct 17 ms 980 KB Output is correct
34 Correct 21 ms 1024 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 3 ms 980 KB Output is correct
38 Correct 22 ms 980 KB Output is correct
39 Correct 2 ms 596 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 0 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 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 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 68 ms 17608 KB Output is correct
12 Correct 40 ms 11852 KB Output is correct
13 Correct 60 ms 14504 KB Output is correct
14 Correct 82 ms 17616 KB Output is correct
15 Correct 61 ms 17616 KB Output is correct
16 Correct 54 ms 17600 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 0 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 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 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 68 ms 17608 KB Output is correct
12 Correct 40 ms 11852 KB Output is correct
13 Correct 60 ms 14504 KB Output is correct
14 Correct 82 ms 17616 KB Output is correct
15 Correct 61 ms 17616 KB Output is correct
16 Correct 54 ms 17600 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 320 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 87 ms 18312 KB Output is correct
23 Correct 77 ms 17292 KB Output is correct
24 Correct 64 ms 13072 KB Output is correct
25 Correct 76 ms 17848 KB Output is correct
26 Correct 67 ms 17624 KB Output is correct

Subtask #5
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 0 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 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 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 68 ms 17608 KB Output is correct
12 Correct 40 ms 11852 KB Output is correct
13 Correct 60 ms 14504 KB Output is correct
14 Correct 82 ms 17616 KB Output is correct
15 Correct 61 ms 17616 KB Output is correct
16 Correct 54 ms 17600 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 320 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 87 ms 18312 KB Output is correct
23 Correct 77 ms 17292 KB Output is correct
24 Correct 64 ms 13072 KB Output is correct
25 Correct 76 ms 17848 KB Output is correct
26 Correct 67 ms 17624 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 27 ms 1004 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 3 ms 480 KB Output is correct
34 Correct 130 ms 27760 KB Output is correct
35 Execution timed out 2076 ms 23444 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #6
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 0 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 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 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 68 ms 17608 KB Output is correct
12 Correct 40 ms 11852 KB Output is correct
13 Correct 60 ms 14504 KB Output is correct
14 Correct 82 ms 17616 KB Output is correct
15 Correct 61 ms 17616 KB Output is correct
16 Correct 54 ms 17600 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 320 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 87 ms 18312 KB Output is correct
23 Correct 77 ms 17292 KB Output is correct
24 Correct 64 ms 13072 KB Output is correct
25 Correct 76 ms 17848 KB Output is correct
26 Correct 67 ms 17624 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 27 ms 1004 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 3 ms 480 KB Output is correct
34 Correct 130 ms 27760 KB Output is correct
35 Execution timed out 2076 ms 23444 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #7
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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 320 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 1 ms 320 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 3 ms 980 KB Output is correct
27 Correct 11 ms 980 KB Output is correct
28 Correct 17 ms 1088 KB Output is correct
29 Correct 26 ms 1080 KB Output is correct
30 Correct 13 ms 724 KB Output is correct
31 Correct 8 ms 1036 KB Output is correct
32 Correct 24 ms 980 KB Output is correct
33 Correct 17 ms 980 KB Output is correct
34 Correct 21 ms 1024 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 3 ms 980 KB Output is correct
38 Correct 22 ms 980 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 0 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 316 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 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 1 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 68 ms 17608 KB Output is correct
51 Correct 40 ms 11852 KB Output is correct
52 Correct 60 ms 14504 KB Output is correct
53 Correct 82 ms 17616 KB Output is correct
54 Correct 61 ms 17616 KB Output is correct
55 Correct 54 ms 17600 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 320 KB Output is correct
60 Correct 1 ms 596 KB Output is correct
61 Correct 87 ms 18312 KB Output is correct
62 Correct 77 ms 17292 KB Output is correct
63 Correct 64 ms 13072 KB Output is correct
64 Correct 76 ms 17848 KB Output is correct
65 Correct 67 ms 17624 KB Output is correct
66 Correct 1 ms 316 KB Output is correct
67 Correct 1 ms 320 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 27 ms 1004 KB Output is correct
71 Correct 1 ms 468 KB Output is correct
72 Correct 3 ms 480 KB Output is correct
73 Correct 130 ms 27760 KB Output is correct
74 Execution timed out 2076 ms 23444 KB Time limit exceeded
75 Halted 0 ms 0 KB -