oj.uz

Submission #892567

# Submission time Handle Problem Language Result Execution time Memory
892567 2023-12-25T14:01:28 Z ReLice Team Contest (JOI22_team) C++14
100 / 100
 396 ms 32444 KB 
#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define mpa make_pair
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define bc back()
#define ar array
#define vll vector<ll> 
using namespace std;/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;*/
template <class _T>
bool chmin(_T &x, const _T &y){
    if(x>y){
        x=y;
        return true;
    }
    return false;
}
template <class _T>
bool chmax(_T &x, const _T &y){
    bool flag=false;
    if (x<y){
        x=y;flag|=true;
    }
    return flag;
}
//#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=2e18+7;
const ll mod=1e9+7;
const ll N=2e5+7;
const ld eps=1e-9;

void solve(){
	ll i;
	ll n,k;
	cin>>n;
	ll xx[n],yy[n],zz[n];
	set<pair<ll,ll>> x,y,z;
	for(i=0;i<n;i++){
		ll a,b,c;
		cin>>a>>b>>c;
		xx[i]=a;
		yy[i]=b;
		zz[i]=c;
		x.ins({a,i});
		y.ins({b,i});
		z.ins({c,i});
	}
	for(i=0;i<n;i++){
		vector<ll> v;
		v.pb(x.rbegin()->sc);
		v.pb(y.rbegin()->sc);
		v.pb(z.rbegin()->sc);
		if(yy[v[1]]==yy[v[0]] || zz[v[0]]==zz[v[2]]){
			x.erase(x.find({xx[v[0]],v[0]}));
			y.erase(y.find({yy[v[0]],v[0]}));
			z.erase(z.find({zz[v[0]],v[0]}));
		}else if(xx[v[1]]==xx[v[0]] || zz[v[1]]==zz[v[2]]){
			x.erase(x.find({xx[v[1]],v[1]}));
			y.erase(y.find({yy[v[1]],v[1]}));
			z.erase(z.find({zz[v[1]],v[1]}));
		}else if(xx[v[2]]==xx[v[0]] || yy[v[1]]==yy[v[2]]){
			x.erase(x.find({xx[v[2]],v[2]}));
			y.erase(y.find({yy[v[2]],v[2]}));
			z.erase(z.find({zz[v[2]],v[2]}));
		}else{
			cout<<xx[v[0]]+yy[v[1]]+zz[v[2]]<<endl;
			return;
		}
	}
	cout<<-1<<endl;
}
signed main(){
	start();
    ll t=1;
	//cin>>t;
    while(t--) solve();
    return 0;
}
/*
1
7
1 2
2 3
3 4
4 5
3 6
6 7
2
4 1
5 7






*/

Compilation message

team.cpp: In function 'void solve()':
team.cpp:56:7: warning: unused variable 'k' [-Wunused-variable]
   56 |  ll n,k;
      |       ^
team.cpp: In function 'void fre(std::string)':
team.cpp:43:27: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
team.cpp:43:64: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                                                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 4 ms 1112 KB Output is correct
27 Correct 5 ms 1116 KB Output is correct
28 Correct 4 ms 1084 KB Output is correct
29 Correct 5 ms 1116 KB Output is correct
30 Correct 3 ms 860 KB Output is correct
31 Correct 3 ms 1116 KB Output is correct
32 Correct 4 ms 1116 KB Output is correct
33 Correct 4 ms 1116 KB Output is correct
34 Correct 3 ms 1116 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 2 ms 1116 KB Output is correct
38 Correct 3 ms 1116 KB Output is correct
39 Correct 1 ms 860 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 140 ms 32132 KB Output is correct
12 Correct 120 ms 21332 KB Output is correct
13 Correct 107 ms 26524 KB Output is correct
14 Correct 188 ms 32088 KB Output is correct
15 Correct 138 ms 32084 KB Output is correct
16 Correct 139 ms 32084 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 140 ms 32132 KB Output is correct
12 Correct 120 ms 21332 KB Output is correct
13 Correct 107 ms 26524 KB Output is correct
14 Correct 188 ms 32088 KB Output is correct
15 Correct 138 ms 32084 KB Output is correct
16 Correct 139 ms 32084 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 179 ms 32444 KB Output is correct
23 Correct 174 ms 31312 KB Output is correct
24 Correct 151 ms 23128 KB Output is correct
25 Correct 257 ms 31828 KB Output is correct
26 Correct 144 ms 32084 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 140 ms 32132 KB Output is correct
12 Correct 120 ms 21332 KB Output is correct
13 Correct 107 ms 26524 KB Output is correct
14 Correct 188 ms 32088 KB Output is correct
15 Correct 138 ms 32084 KB Output is correct
16 Correct 139 ms 32084 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 179 ms 32444 KB Output is correct
23 Correct 174 ms 31312 KB Output is correct
24 Correct 151 ms 23128 KB Output is correct
25 Correct 257 ms 31828 KB Output is correct
26 Correct 144 ms 32084 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 4 ms 1116 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 225 ms 30612 KB Output is correct
35 Correct 242 ms 28936 KB Output is correct
36 Correct 289 ms 32120 KB Output is correct
37 Correct 344 ms 32084 KB Output is correct
38 Correct 191 ms 31316 KB Output is correct
39 Correct 94 ms 19440 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 140 ms 32132 KB Output is correct
12 Correct 120 ms 21332 KB Output is correct
13 Correct 107 ms 26524 KB Output is correct
14 Correct 188 ms 32088 KB Output is correct
15 Correct 138 ms 32084 KB Output is correct
16 Correct 139 ms 32084 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 179 ms 32444 KB Output is correct
23 Correct 174 ms 31312 KB Output is correct
24 Correct 151 ms 23128 KB Output is correct
25 Correct 257 ms 31828 KB Output is correct
26 Correct 144 ms 32084 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 4 ms 1116 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 225 ms 30612 KB Output is correct
35 Correct 242 ms 28936 KB Output is correct
36 Correct 289 ms 32120 KB Output is correct
37 Correct 344 ms 32084 KB Output is correct
38 Correct 191 ms 31316 KB Output is correct
39 Correct 94 ms 19440 KB Output is correct
40 Correct 3 ms 856 KB Output is correct
41 Correct 3 ms 1112 KB Output is correct
42 Correct 2 ms 1116 KB Output is correct
43 Correct 3 ms 1116 KB Output is correct
44 Correct 316 ms 32084 KB Output is correct
45 Correct 380 ms 31892 KB Output is correct
46 Correct 353 ms 32132 KB Output is correct
47 Correct 394 ms 32092 KB Output is correct
48 Correct 216 ms 32024 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 4 ms 1112 KB Output is correct
27 Correct 5 ms 1116 KB Output is correct
28 Correct 4 ms 1084 KB Output is correct
29 Correct 5 ms 1116 KB Output is correct
30 Correct 3 ms 860 KB Output is correct
31 Correct 3 ms 1116 KB Output is correct
32 Correct 4 ms 1116 KB Output is correct
33 Correct 4 ms 1116 KB Output is correct
34 Correct 3 ms 1116 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 2 ms 1116 KB Output is correct
38 Correct 3 ms 1116 KB Output is correct
39 Correct 1 ms 860 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 140 ms 32132 KB Output is correct
51 Correct 120 ms 21332 KB Output is correct
52 Correct 107 ms 26524 KB Output is correct
53 Correct 188 ms 32088 KB Output is correct
54 Correct 138 ms 32084 KB Output is correct
55 Correct 139 ms 32084 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 2 ms 860 KB Output is correct
61 Correct 179 ms 32444 KB Output is correct
62 Correct 174 ms 31312 KB Output is correct
63 Correct 151 ms 23128 KB Output is correct
64 Correct 257 ms 31828 KB Output is correct
65 Correct 144 ms 32084 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 4 ms 1116 KB Output is correct
71 Correct 1 ms 604 KB Output is correct
72 Correct 1 ms 604 KB Output is correct
73 Correct 225 ms 30612 KB Output is correct
74 Correct 242 ms 28936 KB Output is correct
75 Correct 289 ms 32120 KB Output is correct
76 Correct 344 ms 32084 KB Output is correct
77 Correct 191 ms 31316 KB Output is correct
78 Correct 94 ms 19440 KB Output is correct
79 Correct 3 ms 856 KB Output is correct
80 Correct 3 ms 1112 KB Output is correct
81 Correct 2 ms 1116 KB Output is correct
82 Correct 3 ms 1116 KB Output is correct
83 Correct 316 ms 32084 KB Output is correct
84 Correct 380 ms 31892 KB Output is correct
85 Correct 353 ms 32132 KB Output is correct
86 Correct 394 ms 32092 KB Output is correct
87 Correct 216 ms 32024 KB Output is correct
88 Correct 279 ms 32052 KB Output is correct
89 Correct 312 ms 32032 KB Output is correct
90 Correct 290 ms 31920 KB Output is correct
91 Correct 396 ms 32132 KB Output is correct
92 Correct 309 ms 32084 KB Output is correct
93 Correct 335 ms 31936 KB Output is correct
94 Correct 358 ms 32132 KB Output is correct
95 Correct 221 ms 32084 KB Output is correct
96 Correct 183 ms 32080 KB Output is correct
97 Correct 155 ms 32084 KB Output is correct
98 Correct 146 ms 31900 KB Output is correct
99 Correct 157 ms 32080 KB Output is correct