Submission #544849

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
544849	2022-04-02T20:54:58 Z	Ronin13	Team Contest (JOI22_team)	C++14	0 / 100	52 ms	6264 KB

team

#include<iostream>
#include <math.h>
#include <queue>
#define ll long long
#define f first
#define s second
#define pii pair<int, int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define ull unsigned ll

#pragma optimization("unroll-loops")
#pragma optimize("Ofast")
#pragma optimize("3")
#pragma target("avx2,avx,fma")

using namespace std;


int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    int n; cin >> n;
    int x[n + 1];
    int y[n + 1];
    int z[n + 1];

    for(int i = 1; i <= n; i++){
        cin >> x[i] >> y[i] >> z[i];
    }
    int ans = -1;
    priority_queue <pii> px, py, pz;
    for(int i = 1; i <= n; i++){
        px.push({x[i], i});
        py.push({y[i], i});
        pz.push({z[i], i});
    }
    while(!px.empty()){
        int i = px.top().s;
        px.pop();
        while(!py.empty()){
            int j = py.top().s;
            if(x[j] >= x[i]){
                py.pop();
                continue;
            }
            if(y[i] >= y[j])break;
            bool indd = false;
            while(!pz.empty()){
                int k = pz.top().s;
                if(x[k] >= x[i] || y[k] >= y[j])pz.pop();
                if(z[j] >= z[k]){
                    indd = true;
                    break;
                }
                if(z[i] >= z[k])break;
                cout << z[k] + x[i] + y[j];
                return 0;
            }
            if(indd || pz.empty())py.pop();
            else break;
        }
    }
    cout << -1;
    return 0;
}

Compilation message

team.cpp:13: warning: ignoring '#pragma optimization ' [-Wunknown-pragmas]
   13 | #pragma optimization("unroll-loops")
      | 
team.cpp:14: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
   14 | #pragma optimize("Ofast")
      | 
team.cpp:15: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
   15 | #pragma optimize("3")
      | 
team.cpp:16: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
   16 | #pragma target("avx2,avx,fma")
      | 
team.cpp: In function 'int main()':
team.cpp:31:9: warning: unused variable 'ans' [-Wunused-variable]
   31 |     int ans = -1;
      |         ^~~

Subtask #1
0 / 8.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Correct	212 KB	Output is correct
5	Correct	212 KB	Output is correct
6	Correct	212 KB	Output is correct
7	Correct	212 KB	Output is correct
8	Correct	212 KB	Output is correct
9	Correct	212 KB	Output is correct
10	Correct	212 KB	Output is correct
11	Correct	212 KB	Output is correct
12	Correct	212 KB	Output is correct
13	Correct	212 KB	Output is correct
14	Correct	340 KB	Output is correct
15	Incorrect	212 KB	Output isn't correct
16	Halted	0 KB	-

Subtask #2
0 / 29.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Correct	212 KB	Output is correct
5	Correct	212 KB	Output is correct
6	Correct	212 KB	Output is correct
7	Correct	212 KB	Output is correct
8	Correct	212 KB	Output is correct
9	Correct	212 KB	Output is correct
10	Correct	212 KB	Output is correct
11	Correct	212 KB	Output is correct
12	Correct	212 KB	Output is correct
13	Correct	212 KB	Output is correct
14	Correct	340 KB	Output is correct
15	Incorrect	212 KB	Output isn't correct
16	Halted	0 KB	-

Subtask #3
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 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	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	1 ms	244 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	52 ms	6264 KB	Output is correct
12	Incorrect	29 ms	3896 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #4
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 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	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	1 ms	244 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	52 ms	6264 KB	Output is correct
12	Incorrect	29 ms	3896 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #5
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 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	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	1 ms	244 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	52 ms	6264 KB	Output is correct
12	Incorrect	29 ms	3896 KB	Output isn't correct
13	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	1 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	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	1 ms	244 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	52 ms	6264 KB	Output is correct
12	Incorrect	29 ms	3896 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #7
0 / 27.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Correct	212 KB	Output is correct
5	Correct	212 KB	Output is correct
6	Correct	212 KB	Output is correct
7	Correct	212 KB	Output is correct
8	Correct	212 KB	Output is correct
9	Correct	212 KB	Output is correct
10	Correct	212 KB	Output is correct
11	Correct	212 KB	Output is correct
12	Correct	212 KB	Output is correct
13	Correct	212 KB	Output is correct
14	Correct	340 KB	Output is correct
15	Incorrect	212 KB	Output isn't correct
16	Halted	0 KB	-

Submission #544849

Compilation message

Subtask #1 0 / 8.0

Subtask #2 0 / 29.0

Subtask #3 0 / 9.0

Subtask #4 0 / 9.0

Subtask #5 0 / 9.0

Subtask #6 0 / 9.0

Subtask #7 0 / 27.0

Subtask #1
0 / 8.0

Subtask #2
0 / 29.0

Subtask #3
0 / 9.0

Subtask #4
0 / 9.0

Subtask #5
0 / 9.0

Subtask #6
0 / 9.0

Subtask #7
0 / 27.0