oj.uz

Submission #713835

# Submission time Handle Problem Language Result Execution time Memory
713835 2023-03-23T05:58:36 Z scottchou Team Contest (JOI22_team) C++17
37 / 100
 2000 ms 4456 KB 
#include<bits/stdc++.h>
using namespace std;
int const N = 150005;
struct Person{
    int x, y, z;
}a[N];
bool cmp(Person x, Person y){
    return x.x < y.x;
}
bool cmp2(Person x, Person y){
    return x.y < y.y;
}
int main(){
    int n;
    cin >> n;
    vector<int> xsort, ysort, zsort;
    for(int i = 0; i < n; i++){
        cin >> a[i].x >> a[i].y >> a[i].z;
        xsort.push_back(a[i].x);
        ysort.push_back(a[i].y);
        zsort.push_back(a[i].z);
    }
    sort(a, a + n, cmp);
    sort(xsort.begin(), xsort.end());
    sort(ysort.begin(), ysort.end());
    sort(ysort.begin(), ysort.end());
    xsort.resize(unique(xsort.begin(), xsort.end()) - xsort.begin());
    ysort.resize(unique(ysort.begin(), ysort.end()) - ysort.begin());
    zsort.resize(unique(zsort.begin(), zsort.end()) - zsort.begin());
    vector<Person> p;
    int last = 0, ans = 0;
    for(int i = 0; i < n; i++){
        if(a[i].x != a[i - 1].x){
            for(; last < i; last++){
                p.push_back(a[last]);
            }
            sort(p.begin(), p.end(), cmp2);
        }
        if(p.empty())
            continue;
        int maxz = 0;
        vector<int> prez(p.size());
        prez[0] = 0;
        int lastt = 0;
        for(int j = 1; j < p.size(); j++){
            prez[j] = prez[j - 1];
            if(p[j].y != p[j - 1].y){
                for(; lastt < j; lastt++){
                    prez[j] = max(prez[j], p[lastt].z);
                }
            }
        }
        for(int j = p.size() - 1; j >= 0 && p[j].y > a[i].y; j--){
            if(p[j].z < prez[j] && a[i].z < prez[j]){
                ans = max(ans, prez[j] + p[j].y + a[i].x);
            }
        }
    }
    if(!ans){
        cout << -1 << '\n';
    }else
        cout << ans << '\n';
}

Compilation message

team.cpp: In function 'int main()':
team.cpp:45:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Person>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for(int j = 1; j < p.size(); j++){
      |                        ~~^~~~~~~~~~
team.cpp:41:13: warning: unused variable 'maxz' [-Wunused-variable]
   41 |         int maxz = 0;
      |             ^~~~

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 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 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 0 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 3 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 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 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 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 0 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 3 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 550 ms 516 KB Output is correct
27 Correct 314 ms 468 KB Output is correct
28 Correct 276 ms 632 KB Output is correct
29 Correct 218 ms 508 KB Output is correct
30 Correct 136 ms 480 KB Output is correct
31 Correct 185 ms 568 KB Output is correct
32 Correct 55 ms 500 KB Output is correct
33 Correct 19 ms 340 KB Output is correct
34 Correct 281 ms 464 KB Output is correct
35 Correct 5 ms 340 KB Output is correct
36 Correct 6 ms 380 KB Output is correct
37 Correct 105 ms 488 KB Output is correct
38 Correct 103 ms 500 KB Output is correct
39 Correct 10 ms 404 KB Output is correct

Subtask #3
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 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 1 ms 212 KB Output is correct
11 Execution timed out 2091 ms 4456 KB Time limit exceeded
12 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 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 1 ms 212 KB Output is correct
11 Execution timed out 2091 ms 4456 KB Time limit exceeded
12 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 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 1 ms 212 KB Output is correct
11 Execution timed out 2091 ms 4456 KB Time limit exceeded
12 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 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 1 ms 212 KB Output is correct
11 Execution timed out 2091 ms 4456 KB Time limit exceeded
12 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 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 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 0 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 3 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 550 ms 516 KB Output is correct
27 Correct 314 ms 468 KB Output is correct
28 Correct 276 ms 632 KB Output is correct
29 Correct 218 ms 508 KB Output is correct
30 Correct 136 ms 480 KB Output is correct
31 Correct 185 ms 568 KB Output is correct
32 Correct 55 ms 500 KB Output is correct
33 Correct 19 ms 340 KB Output is correct
34 Correct 281 ms 464 KB Output is correct
35 Correct 5 ms 340 KB Output is correct
36 Correct 6 ms 380 KB Output is correct
37 Correct 105 ms 488 KB Output is correct
38 Correct 103 ms 500 KB Output is correct
39 Correct 10 ms 404 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 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 0 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 1 ms 212 KB Output is correct
50 Execution timed out 2091 ms 4456 KB Time limit exceeded
51 Halted 0 ms 0 KB -