Submission #556199

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
556199	2022-05-02T15:08:05 Z	600Mihnea	Team Contest (JOI22_team)	C++17	8 / 100	2000 ms	2004 KB

team

#include <bits/stdc++.h>

bool home = 1;

using namespace std;

struct T {
  int x;
  int y;
  int z;
};

bool cmp_x_inv(T a,T b) {
  return a.x>b.x;
}

typedef long long ll;
const int N=150000+7;
int n;
T a[N];

signed main() {
#ifdef ONLINE_JUDGE
  home = 0;
#endif

  home=0;

  if (home) {
    freopen("I_am_iron_man", "r", stdin);
  }
  else {
    ios::sync_with_stdio(0); cin.tie(0);
  }

  cin>>n;
  for (int i=1;i<=n;i++) {
    cin>>a[i].x>>a[i].y>>a[i].z;
  }
  sort(a+1,a+n+1,cmp_x_inv);
  int sol=-1;

  int last=n;

  while(last>=1){
    int first=last;
    while(first-1>=1&&a[first-1].x==a[first].x) first--;

    for (int i=first;i<=last;i++) {
      for (int j=last+1;j<=n;j++) {
        for (int k=j+1;k<=n;k++) {

          assert(a[i].x>max(a[j].x,a[k].x));

          if (a[j].y>max(a[i].y,a[k].y) && a[k].z>max(a[i].z,a[j].z)) sol=max(sol,a[i].x+a[j].y+a[k].z);
          if (a[j].z>max(a[i].z,a[k].z) && a[k].y>max(a[i].y,a[j].y)) sol=max(sol,a[i].x+a[j].z+a[k].y);

        }
      }
    }

    last=first-1;
  }


  cout<<sol<<"\n";
}

Compilation message

team.cpp: In function 'int main()':
team.cpp:30:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     freopen("I_am_iron_man", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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	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	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	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	21 ms	212 KB	Output is correct
15	Correct	7 ms	332 KB	Output is correct
16	Correct	10 ms	212 KB	Output is correct
17	Correct	11 ms	212 KB	Output is correct
18	Correct	15 ms	212 KB	Output is correct
19	Correct	17 ms	212 KB	Output is correct
20	Correct	12 ms	340 KB	Output is correct
21	Correct	2 ms	212 KB	Output is correct
22	Correct	8 ms	336 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	8 ms	212 KB	Output is correct
25	Correct	9 ms	336 KB	Output is correct

Subtask #2
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	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	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	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	21 ms	212 KB	Output is correct
15	Correct	7 ms	332 KB	Output is correct
16	Correct	10 ms	212 KB	Output is correct
17	Correct	11 ms	212 KB	Output is correct
18	Correct	15 ms	212 KB	Output is correct
19	Correct	17 ms	212 KB	Output is correct
20	Correct	12 ms	340 KB	Output is correct
21	Correct	2 ms	212 KB	Output is correct
22	Correct	8 ms	336 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	8 ms	212 KB	Output is correct
25	Correct	9 ms	336 KB	Output is correct
26	Execution timed out	2096 ms	340 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-

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	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	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	Execution timed out	2086 ms	2004 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	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	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	Execution timed out	2086 ms	2004 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	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	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	Execution timed out	2086 ms	2004 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	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	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	Execution timed out	2086 ms	2004 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	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	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	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	21 ms	212 KB	Output is correct
15	Correct	7 ms	332 KB	Output is correct
16	Correct	10 ms	212 KB	Output is correct
17	Correct	11 ms	212 KB	Output is correct
18	Correct	15 ms	212 KB	Output is correct
19	Correct	17 ms	212 KB	Output is correct
20	Correct	12 ms	340 KB	Output is correct
21	Correct	2 ms	212 KB	Output is correct
22	Correct	8 ms	336 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	8 ms	212 KB	Output is correct
25	Correct	9 ms	336 KB	Output is correct
26	Execution timed out	2096 ms	340 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-

Submission #556199

Compilation message

Subtask #1 8.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
8.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