oj.uz

Submission #556240

# Submission time Handle Problem Language Result Execution time Memory
556240 2022-05-02T15:44:20 Z 600Mihnea Team Contest (JOI22_team) C++17
73 / 100
 2000 ms 139088 KB 
#include <bits/stdc++.h>

bool home = 1;

using namespace std;

struct T {
  int x;
  int y;
  int z;
  int tx;
  int ty;
  int tz;
};

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

typedef long long ll;
const int N=150000+7;
const int INF=(int)1e9+7;
int n,zm[N],invy[N],invz[N],value[N];
T a[N];
int aib1[N];

void clr1() {
  for (int i=1;i<=n;i++) aib1[i]=-INF;
}

int get1(int i) {
  int sol=-INF;
  while (i) {
    sol=max(sol,aib1[i]);
    i-=i&(-i);
  }
  return sol;
}

void upd1(int i,int x) {
  while (i<=n){
    aib1[i]=max(aib1[i],x);
    i+=i&(-i);
  }
}

unordered_map<int, int> aib[N];
int dim[N];

void clr() {
  for (int i=1;i<=n;i++) aib[i].clear(),dim[i]=0;
}

void upd(int x,int y,int val) {
  for (int i=x;i<=n;i+=i&(-i)) {
    for (int j=y;j<=n;j+=j&(-j)) {
      aib[i][j]=max(aib[i][j],val);
    }
  }
}

int get(int x,int y) {
  int sol=-INF;
  for (int i=x;i>=1;i-=i&(-i)) {
    for (int j=y;j>=1;j-=j&(-j)) {
      if (aib[i].count(j)) {
        sol=max(sol,aib[i][j]);
      }
    }
  }
  return sol;
}

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);
  {
    map<int, int> tx,ty,tz;
    for (int i=1;i<=n;i++) tx[a[i].x]=0,ty[a[i].y]=0,tz[a[i].z]=0;
    int ind;
    ind=0; for (auto &it:tx)it.second=++ind;
    ind=0; for (auto &it:ty)it.second=++ind, invy[ind]=it.first;
    ind=0; for (auto &it:tz)it.second=++ind, invz[ind]=it.first;
    for (int i=1;i<=n;i++) a[i].tx=tx[a[i].x], a[i].ty=ty[a[i].y], a[i].tz=tz[a[i].z];
  }
  int print=-1;

  for (int ITER=0;ITER<2;ITER++) {
    clr1();
    clr();

    for (int i=n;i>=1;i--) { /// optimize using aib
      zm[i]=get1(a[i].ty-1);
      upd1(a[i].ty,a[i].tz);
      if (zm[i]<=a[i].tz) zm[i]=-INF;

      if (1<=zm[i]&&zm[i]<=n) value[i]=invz[zm[i]]+a[i].y; else assert(zm[i]==-INF);
    }

    for (int i=1;i<=n;i++) {
      if(zm[i]==-INF) continue;
      int y=n+1-a[i].ty,z=n+1-zm[i];
      for (int p=y;p<=n;p+=p&(-p)) {
        dim[p]++;
      }
    }
    for (int i=1;i<=n;i++) aib[i].rehash(2*dim[i]);

    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++) {
        print=max(print,get(n-a[i].ty,n-a[i].tz)+a[i].x);
      }

      for (int i=first;i<=last;i++) {
        if (zm[i]!=-INF) {
          upd(n+1-a[i].ty,n+1-zm[i],value[i]);
        }
      }
      last=first-1;
    }
    for (int i=1;i<=n;i++) swap(a[i].y,a[i].z), swap(a[i].ty,a[i].tz), swap(invz[i],invy[i]);
  }

  cout<<print<<"\n";
}

Compilation message

team.cpp: In function 'int main()':
team.cpp:118:25: warning: unused variable 'z' [-Wunused-variable]
  118 |       int y=n+1-a[i].ty,z=n+1-zm[i];
      |                         ^
team.cpp:82:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |     freopen("I_am_iron_man", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8532 KB Output is correct
2 Correct 6 ms 8532 KB Output is correct
3 Correct 5 ms 8532 KB Output is correct
4 Correct 5 ms 8544 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 5 ms 8532 KB Output is correct
7 Correct 4 ms 8532 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 5 ms 8532 KB Output is correct
10 Correct 5 ms 8532 KB Output is correct
11 Correct 4 ms 8532 KB Output is correct
12 Correct 7 ms 8452 KB Output is correct
13 Correct 4 ms 8524 KB Output is correct
14 Correct 6 ms 8660 KB Output is correct
15 Correct 5 ms 8532 KB Output is correct
16 Correct 7 ms 8532 KB Output is correct
17 Correct 6 ms 8528 KB Output is correct
18 Correct 6 ms 8532 KB Output is correct
19 Correct 5 ms 8604 KB Output is correct
20 Correct 6 ms 8532 KB Output is correct
21 Correct 5 ms 8532 KB Output is correct
22 Correct 6 ms 8532 KB Output is correct
23 Correct 5 ms 8516 KB Output is correct
24 Correct 5 ms 8532 KB Output is correct
25 Correct 5 ms 8532 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8532 KB Output is correct
2 Correct 6 ms 8532 KB Output is correct
3 Correct 5 ms 8532 KB Output is correct
4 Correct 5 ms 8544 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 5 ms 8532 KB Output is correct
7 Correct 4 ms 8532 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 5 ms 8532 KB Output is correct
10 Correct 5 ms 8532 KB Output is correct
11 Correct 4 ms 8532 KB Output is correct
12 Correct 7 ms 8452 KB Output is correct
13 Correct 4 ms 8524 KB Output is correct
14 Correct 6 ms 8660 KB Output is correct
15 Correct 5 ms 8532 KB Output is correct
16 Correct 7 ms 8532 KB Output is correct
17 Correct 6 ms 8528 KB Output is correct
18 Correct 6 ms 8532 KB Output is correct
19 Correct 5 ms 8604 KB Output is correct
20 Correct 6 ms 8532 KB Output is correct
21 Correct 5 ms 8532 KB Output is correct
22 Correct 6 ms 8532 KB Output is correct
23 Correct 5 ms 8516 KB Output is correct
24 Correct 5 ms 8532 KB Output is correct
25 Correct 5 ms 8532 KB Output is correct
26 Correct 38 ms 11212 KB Output is correct
27 Correct 23 ms 9780 KB Output is correct
28 Correct 23 ms 9712 KB Output is correct
29 Correct 17 ms 9300 KB Output is correct
30 Correct 15 ms 9252 KB Output is correct
31 Correct 22 ms 9456 KB Output is correct
32 Correct 14 ms 9148 KB Output is correct
33 Correct 13 ms 9004 KB Output is correct
34 Correct 14 ms 9300 KB Output is correct
35 Correct 6 ms 8660 KB Output is correct
36 Correct 6 ms 8660 KB Output is correct
37 Correct 11 ms 8916 KB Output is correct
38 Correct 11 ms 8980 KB Output is correct
39 Correct 9 ms 8728 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8532 KB Output is correct
2 Correct 5 ms 8532 KB Output is correct
3 Correct 5 ms 8532 KB Output is correct
4 Correct 5 ms 8532 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 5 ms 8532 KB Output is correct
7 Correct 5 ms 8532 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 5 ms 8568 KB Output is correct
10 Correct 5 ms 8532 KB Output is correct
11 Correct 357 ms 23884 KB Output is correct
12 Correct 188 ms 17660 KB Output is correct
13 Correct 300 ms 18088 KB Output is correct
14 Correct 336 ms 22464 KB Output is correct
15 Correct 342 ms 22496 KB Output is correct
16 Correct 382 ms 19688 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8532 KB Output is correct
2 Correct 5 ms 8532 KB Output is correct
3 Correct 5 ms 8532 KB Output is correct
4 Correct 5 ms 8532 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 5 ms 8532 KB Output is correct
7 Correct 5 ms 8532 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 5 ms 8568 KB Output is correct
10 Correct 5 ms 8532 KB Output is correct
11 Correct 357 ms 23884 KB Output is correct
12 Correct 188 ms 17660 KB Output is correct
13 Correct 300 ms 18088 KB Output is correct
14 Correct 336 ms 22464 KB Output is correct
15 Correct 342 ms 22496 KB Output is correct
16 Correct 382 ms 19688 KB Output is correct
17 Correct 5 ms 8532 KB Output is correct
18 Correct 5 ms 8468 KB Output is correct
19 Correct 4 ms 8532 KB Output is correct
20 Correct 5 ms 8532 KB Output is correct
21 Correct 9 ms 8788 KB Output is correct
22 Correct 384 ms 26952 KB Output is correct
23 Correct 368 ms 24504 KB Output is correct
24 Correct 184 ms 20564 KB Output is correct
25 Correct 268 ms 23916 KB Output is correct
26 Correct 310 ms 21924 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8532 KB Output is correct
2 Correct 5 ms 8532 KB Output is correct
3 Correct 5 ms 8532 KB Output is correct
4 Correct 5 ms 8532 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 5 ms 8532 KB Output is correct
7 Correct 5 ms 8532 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 5 ms 8568 KB Output is correct
10 Correct 5 ms 8532 KB Output is correct
11 Correct 357 ms 23884 KB Output is correct
12 Correct 188 ms 17660 KB Output is correct
13 Correct 300 ms 18088 KB Output is correct
14 Correct 336 ms 22464 KB Output is correct
15 Correct 342 ms 22496 KB Output is correct
16 Correct 382 ms 19688 KB Output is correct
17 Correct 5 ms 8532 KB Output is correct
18 Correct 5 ms 8468 KB Output is correct
19 Correct 4 ms 8532 KB Output is correct
20 Correct 5 ms 8532 KB Output is correct
21 Correct 9 ms 8788 KB Output is correct
22 Correct 384 ms 26952 KB Output is correct
23 Correct 368 ms 24504 KB Output is correct
24 Correct 184 ms 20564 KB Output is correct
25 Correct 268 ms 23916 KB Output is correct
26 Correct 310 ms 21924 KB Output is correct
27 Correct 6 ms 8532 KB Output is correct
28 Correct 6 ms 8532 KB Output is correct
29 Correct 5 ms 8532 KB Output is correct
30 Correct 5 ms 8532 KB Output is correct
31 Correct 13 ms 9172 KB Output is correct
32 Correct 6 ms 8660 KB Output is correct
33 Correct 6 ms 8660 KB Output is correct
34 Correct 480 ms 31212 KB Output is correct
35 Correct 349 ms 27176 KB Output is correct
36 Correct 407 ms 28372 KB Output is correct
37 Correct 356 ms 26156 KB Output is correct
38 Correct 324 ms 24084 KB Output is correct
39 Correct 287 ms 22860 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8532 KB Output is correct
2 Correct 5 ms 8532 KB Output is correct
3 Correct 5 ms 8532 KB Output is correct
4 Correct 5 ms 8532 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 5 ms 8532 KB Output is correct
7 Correct 5 ms 8532 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 5 ms 8568 KB Output is correct
10 Correct 5 ms 8532 KB Output is correct
11 Correct 357 ms 23884 KB Output is correct
12 Correct 188 ms 17660 KB Output is correct
13 Correct 300 ms 18088 KB Output is correct
14 Correct 336 ms 22464 KB Output is correct
15 Correct 342 ms 22496 KB Output is correct
16 Correct 382 ms 19688 KB Output is correct
17 Correct 5 ms 8532 KB Output is correct
18 Correct 5 ms 8468 KB Output is correct
19 Correct 4 ms 8532 KB Output is correct
20 Correct 5 ms 8532 KB Output is correct
21 Correct 9 ms 8788 KB Output is correct
22 Correct 384 ms 26952 KB Output is correct
23 Correct 368 ms 24504 KB Output is correct
24 Correct 184 ms 20564 KB Output is correct
25 Correct 268 ms 23916 KB Output is correct
26 Correct 310 ms 21924 KB Output is correct
27 Correct 6 ms 8532 KB Output is correct
28 Correct 6 ms 8532 KB Output is correct
29 Correct 5 ms 8532 KB Output is correct
30 Correct 5 ms 8532 KB Output is correct
31 Correct 13 ms 9172 KB Output is correct
32 Correct 6 ms 8660 KB Output is correct
33 Correct 6 ms 8660 KB Output is correct
34 Correct 480 ms 31212 KB Output is correct
35 Correct 349 ms 27176 KB Output is correct
36 Correct 407 ms 28372 KB Output is correct
37 Correct 356 ms 26156 KB Output is correct
38 Correct 324 ms 24084 KB Output is correct
39 Correct 287 ms 22860 KB Output is correct
40 Correct 15 ms 9256 KB Output is correct
41 Correct 22 ms 9420 KB Output is correct
42 Correct 13 ms 8880 KB Output is correct
43 Correct 14 ms 8980 KB Output is correct
44 Correct 914 ms 36484 KB Output is correct
45 Correct 599 ms 36836 KB Output is correct
46 Correct 607 ms 35880 KB Output is correct
47 Correct 573 ms 36972 KB Output is correct
48 Correct 396 ms 23708 KB Output is correct

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8532 KB Output is correct
2 Correct 6 ms 8532 KB Output is correct
3 Correct 5 ms 8532 KB Output is correct
4 Correct 5 ms 8544 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 5 ms 8532 KB Output is correct
7 Correct 4 ms 8532 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 5 ms 8532 KB Output is correct
10 Correct 5 ms 8532 KB Output is correct
11 Correct 4 ms 8532 KB Output is correct
12 Correct 7 ms 8452 KB Output is correct
13 Correct 4 ms 8524 KB Output is correct
14 Correct 6 ms 8660 KB Output is correct
15 Correct 5 ms 8532 KB Output is correct
16 Correct 7 ms 8532 KB Output is correct
17 Correct 6 ms 8528 KB Output is correct
18 Correct 6 ms 8532 KB Output is correct
19 Correct 5 ms 8604 KB Output is correct
20 Correct 6 ms 8532 KB Output is correct
21 Correct 5 ms 8532 KB Output is correct
22 Correct 6 ms 8532 KB Output is correct
23 Correct 5 ms 8516 KB Output is correct
24 Correct 5 ms 8532 KB Output is correct
25 Correct 5 ms 8532 KB Output is correct
26 Correct 38 ms 11212 KB Output is correct
27 Correct 23 ms 9780 KB Output is correct
28 Correct 23 ms 9712 KB Output is correct
29 Correct 17 ms 9300 KB Output is correct
30 Correct 15 ms 9252 KB Output is correct
31 Correct 22 ms 9456 KB Output is correct
32 Correct 14 ms 9148 KB Output is correct
33 Correct 13 ms 9004 KB Output is correct
34 Correct 14 ms 9300 KB Output is correct
35 Correct 6 ms 8660 KB Output is correct
36 Correct 6 ms 8660 KB Output is correct
37 Correct 11 ms 8916 KB Output is correct
38 Correct 11 ms 8980 KB Output is correct
39 Correct 9 ms 8728 KB Output is correct
40 Correct 5 ms 8532 KB Output is correct
41 Correct 5 ms 8532 KB Output is correct
42 Correct 5 ms 8532 KB Output is correct
43 Correct 5 ms 8532 KB Output is correct
44 Correct 5 ms 8532 KB Output is correct
45 Correct 5 ms 8532 KB Output is correct
46 Correct 5 ms 8532 KB Output is correct
47 Correct 5 ms 8532 KB Output is correct
48 Correct 5 ms 8568 KB Output is correct
49 Correct 5 ms 8532 KB Output is correct
50 Correct 357 ms 23884 KB Output is correct
51 Correct 188 ms 17660 KB Output is correct
52 Correct 300 ms 18088 KB Output is correct
53 Correct 336 ms 22464 KB Output is correct
54 Correct 342 ms 22496 KB Output is correct
55 Correct 382 ms 19688 KB Output is correct
56 Correct 5 ms 8532 KB Output is correct
57 Correct 5 ms 8468 KB Output is correct
58 Correct 4 ms 8532 KB Output is correct
59 Correct 5 ms 8532 KB Output is correct
60 Correct 9 ms 8788 KB Output is correct
61 Correct 384 ms 26952 KB Output is correct
62 Correct 368 ms 24504 KB Output is correct
63 Correct 184 ms 20564 KB Output is correct
64 Correct 268 ms 23916 KB Output is correct
65 Correct 310 ms 21924 KB Output is correct
66 Correct 6 ms 8532 KB Output is correct
67 Correct 6 ms 8532 KB Output is correct
68 Correct 5 ms 8532 KB Output is correct
69 Correct 5 ms 8532 KB Output is correct
70 Correct 13 ms 9172 KB Output is correct
71 Correct 6 ms 8660 KB Output is correct
72 Correct 6 ms 8660 KB Output is correct
73 Correct 480 ms 31212 KB Output is correct
74 Correct 349 ms 27176 KB Output is correct
75 Correct 407 ms 28372 KB Output is correct
76 Correct 356 ms 26156 KB Output is correct
77 Correct 324 ms 24084 KB Output is correct
78 Correct 287 ms 22860 KB Output is correct
79 Correct 15 ms 9256 KB Output is correct
80 Correct 22 ms 9420 KB Output is correct
81 Correct 13 ms 8880 KB Output is correct
82 Correct 14 ms 8980 KB Output is correct
83 Correct 914 ms 36484 KB Output is correct
84 Correct 599 ms 36836 KB Output is correct
85 Correct 607 ms 35880 KB Output is correct
86 Correct 573 ms 36972 KB Output is correct
87 Correct 396 ms 23708 KB Output is correct
88 Execution timed out 2069 ms 139088 KB Time limit exceeded
89 Halted 0 ms 0 KB -