oj.uz

답안 #567713

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
567713 2022-05-24T05:39:45 Z zaneyu Team Contest (JOI22_team) C++14
64 / 100
 2000 ms 2212 KB 
/*input
4
1 2 3
1 2 3
1 2 3
1 2 3
*/
#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;
}
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];
    REP(i,n){
        int mx[3]={0,0,0};
        REP(j,n){
            if(del[j]) continue;
            REP(k,3) MXTO(mx[k],arr[j][k]);
        }
        bool hv=0;
        REP(j,n){
            if(del[j]) continue;
            int c=0;
            REP(k,3) if(arr[j][k]==mx[k]) ++c;
            if(c>=2){
                del[j]=1;
                hv=1;
            }
        }
        if(!hv) break; 
    }
    int mx[3]={0,0,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

# 결과 실행 시간 메모리 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 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 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 280 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 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 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 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 280 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 15 ms 388 KB Output is correct
28 Correct 31 ms 368 KB Output is correct
29 Correct 63 ms 364 KB Output is correct
30 Correct 19 ms 340 KB Output is correct
31 Correct 12 ms 340 KB Output is correct
32 Correct 10 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 97 ms 372 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 2 ms 344 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 22 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 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 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 1 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 21 ms 2160 KB Output is correct
12 Correct 21 ms 1536 KB Output is correct
13 Correct 30 ms 1800 KB Output is correct
14 Correct 37 ms 2132 KB Output is correct
15 Correct 35 ms 2120 KB Output is correct
16 Correct 22 ms 2124 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 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 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 1 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 21 ms 2160 KB Output is correct
12 Correct 21 ms 1536 KB Output is correct
13 Correct 30 ms 1800 KB Output is correct
14 Correct 37 ms 2132 KB Output is correct
15 Correct 35 ms 2120 KB Output is correct
16 Correct 22 ms 2124 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 29 ms 2196 KB Output is correct
23 Correct 51 ms 2168 KB Output is correct
24 Correct 52 ms 1652 KB Output is correct
25 Correct 75 ms 2160 KB Output is correct
26 Correct 33 ms 2180 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 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 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 1 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 21 ms 2160 KB Output is correct
12 Correct 21 ms 1536 KB Output is correct
13 Correct 30 ms 1800 KB Output is correct
14 Correct 37 ms 2132 KB Output is correct
15 Correct 35 ms 2120 KB Output is correct
16 Correct 22 ms 2124 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 29 ms 2196 KB Output is correct
23 Correct 51 ms 2168 KB Output is correct
24 Correct 52 ms 1652 KB Output is correct
25 Correct 75 ms 2160 KB Output is correct
26 Correct 33 ms 2180 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 10 ms 380 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 26 ms 2024 KB Output is correct
35 Correct 365 ms 2044 KB Output is correct
36 Correct 471 ms 2212 KB Output is correct
37 Correct 501 ms 2196 KB Output is correct
38 Correct 26 ms 2132 KB Output is correct
39 Correct 93 ms 1456 KB Output is correct

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 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 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 1 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 21 ms 2160 KB Output is correct
12 Correct 21 ms 1536 KB Output is correct
13 Correct 30 ms 1800 KB Output is correct
14 Correct 37 ms 2132 KB Output is correct
15 Correct 35 ms 2120 KB Output is correct
16 Correct 22 ms 2124 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 29 ms 2196 KB Output is correct
23 Correct 51 ms 2168 KB Output is correct
24 Correct 52 ms 1652 KB Output is correct
25 Correct 75 ms 2160 KB Output is correct
26 Correct 33 ms 2180 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 10 ms 380 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 26 ms 2024 KB Output is correct
35 Correct 365 ms 2044 KB Output is correct
36 Correct 471 ms 2212 KB Output is correct
37 Correct 501 ms 2196 KB Output is correct
38 Correct 26 ms 2132 KB Output is correct
39 Correct 93 ms 1456 KB Output is correct
40 Correct 22 ms 368 KB Output is correct
41 Correct 9 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 21 ms 376 KB Output is correct
44 Correct 30 ms 1972 KB Output is correct
45 Execution timed out 2081 ms 2124 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 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 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 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 280 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 15 ms 388 KB Output is correct
28 Correct 31 ms 368 KB Output is correct
29 Correct 63 ms 364 KB Output is correct
30 Correct 19 ms 340 KB Output is correct
31 Correct 12 ms 340 KB Output is correct
32 Correct 10 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 97 ms 372 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 2 ms 344 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 22 ms 340 KB Output is correct
39 Correct 1 ms 340 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 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 1 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 21 ms 2160 KB Output is correct
51 Correct 21 ms 1536 KB Output is correct
52 Correct 30 ms 1800 KB Output is correct
53 Correct 37 ms 2132 KB Output is correct
54 Correct 35 ms 2120 KB Output is correct
55 Correct 22 ms 2124 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 29 ms 2196 KB Output is correct
62 Correct 51 ms 2168 KB Output is correct
63 Correct 52 ms 1652 KB Output is correct
64 Correct 75 ms 2160 KB Output is correct
65 Correct 33 ms 2180 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 0 ms 340 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 10 ms 380 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 26 ms 2024 KB Output is correct
74 Correct 365 ms 2044 KB Output is correct
75 Correct 471 ms 2212 KB Output is correct
76 Correct 501 ms 2196 KB Output is correct
77 Correct 26 ms 2132 KB Output is correct
78 Correct 93 ms 1456 KB Output is correct
79 Correct 22 ms 368 KB Output is correct
80 Correct 9 ms 340 KB Output is correct
81 Correct 1 ms 340 KB Output is correct
82 Correct 21 ms 376 KB Output is correct
83 Correct 30 ms 1972 KB Output is correct
84 Execution timed out 2081 ms 2124 KB Time limit exceeded
85 Halted 0 ms 0 KB -