oj.uz

Submission #677445

# Submission time Handle Problem Language Result Execution time Memory
677445 2023-01-03T11:27:04 Z DwightKSchrute Team Contest (JOI22_team) C++17
17 / 100
 2000 ms 17624 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();
    
    int ans=-1;
    for(int i=0; i<n; i++)
        for(int j=0; j<n; j++)
            for(int k=0; k<n; k++){
                if(a[i][0]>max(a[j][0],a[k][0]) && a[j][1]>max(a[i][1],a[k][1]) && a[k][2]>max(a[i][2],a[j][2]))
                    ans=max(ans,a[i][0]+a[j][1]+a[k][2]);
            }
    out(ans)
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 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 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 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 41 ms 324 KB Output is correct
15 Correct 16 ms 368 KB Output is correct
16 Correct 25 ms 340 KB Output is correct
17 Correct 30 ms 340 KB Output is correct
18 Correct 31 ms 340 KB Output is correct
19 Correct 39 ms 340 KB Output is correct
20 Correct 14 ms 340 KB Output is correct
21 Correct 18 ms 340 KB Output is correct
22 Correct 22 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 25 ms 340 KB Output is correct
25 Correct 26 ms 368 KB Output is correct

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 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 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 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 41 ms 324 KB Output is correct
15 Correct 16 ms 368 KB Output is correct
16 Correct 25 ms 340 KB Output is correct
17 Correct 30 ms 340 KB Output is correct
18 Correct 31 ms 340 KB Output is correct
19 Correct 39 ms 340 KB Output is correct
20 Correct 14 ms 340 KB Output is correct
21 Correct 18 ms 340 KB Output is correct
22 Correct 22 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 25 ms 340 KB Output is correct
25 Correct 26 ms 368 KB Output is correct
26 Execution timed out 2084 ms 1028 KB Time limit exceeded
27 Halted 0 ms 0 KB -

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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 74 ms 16976 KB Output is correct
12 Correct 41 ms 11852 KB Output is correct
13 Correct 47 ms 14476 KB Output is correct
14 Correct 82 ms 17608 KB Output is correct
15 Correct 81 ms 17624 KB Output is correct
16 Correct 58 ms 17624 KB Output is correct

Subtask #4
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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 74 ms 16976 KB Output is correct
12 Correct 41 ms 11852 KB Output is correct
13 Correct 47 ms 14476 KB Output is correct
14 Correct 82 ms 17608 KB Output is correct
15 Correct 81 ms 17624 KB Output is correct
16 Correct 58 ms 17624 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 14 ms 340 KB Output is correct
21 Execution timed out 2094 ms 596 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #5
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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 74 ms 16976 KB Output is correct
12 Correct 41 ms 11852 KB Output is correct
13 Correct 47 ms 14476 KB Output is correct
14 Correct 82 ms 17608 KB Output is correct
15 Correct 81 ms 17624 KB Output is correct
16 Correct 58 ms 17624 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 14 ms 340 KB Output is correct
21 Execution timed out 2094 ms 596 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 74 ms 16976 KB Output is correct
12 Correct 41 ms 11852 KB Output is correct
13 Correct 47 ms 14476 KB Output is correct
14 Correct 82 ms 17608 KB Output is correct
15 Correct 81 ms 17624 KB Output is correct
16 Correct 58 ms 17624 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 14 ms 340 KB Output is correct
21 Execution timed out 2094 ms 596 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 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 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 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 41 ms 324 KB Output is correct
15 Correct 16 ms 368 KB Output is correct
16 Correct 25 ms 340 KB Output is correct
17 Correct 30 ms 340 KB Output is correct
18 Correct 31 ms 340 KB Output is correct
19 Correct 39 ms 340 KB Output is correct
20 Correct 14 ms 340 KB Output is correct
21 Correct 18 ms 340 KB Output is correct
22 Correct 22 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 25 ms 340 KB Output is correct
25 Correct 26 ms 368 KB Output is correct
26 Execution timed out 2084 ms 1028 KB Time limit exceeded
27 Halted 0 ms 0 KB -