oj.uz

Submission #722093

# Submission time Handle Problem Language Result Execution time Memory
722093 2023-04-11T12:00:13 Z Sam_a17 Team Contest (JOI22_team) C++17
100 / 100
 642 ms 197044 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  //ios_base::sync_with_stdio(false);
  //cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 250005, M = 5005;
long long x[N], y[N], z[N];
long long n, is_del[N];
long long mat[M][M];

set<pair<long long, long long>> sty, stz;

void del(long long index) {
  if(sty.find({y[index], index}) != sty.end()) sty.erase({y[index], index});
  if(stz.find({z[index], index}) != stz.end()) stz.erase({z[index], index});
}

struct node {
  long long x;
  long long index;
};

vector<pair<long long, long long>> vecc;

void solve_() {
  cin >> n;

  vector<pair<long long, int>> xs, ys, zs;
  vector<pair<pair<long long, long long>, long long>> vec;
  vector<long long> values_x, values_y;
  for(int i = 1; i <= n; i++) {
    cin >> x[i] >> y[i] >> z[i];

    values_x.push_back(x[i]);
    values_y.push_back(y[i]);
    vec.push_back({{x[i], y[i]}, z[i]});
  }


  if(n <= 4000) {
    sort(all(vec));
    uniq(vec);
 
    sort(all(values_x));
    uniq(values_x);
    
    sort(all(values_y));
    uniq(values_y);
 
    n = sz(vec);
 
    auto getx = [&](long long val)-> int { 
      return lower_bound(all(values_x), val) - values_x.begin() + 1;
    };
 
    auto gety = [&](long long val)-> int { 
      return lower_bound(all(values_y), val) - values_y.begin() + 1;
    };
 
    for(int i = 1; i <= n; i++) {
      x[i] = getx(vec[i - 1].first.first);
      y[i] = gety(vec[i - 1].first.second);
      z[i] = vec[i - 1].second;
 
      if(x[i] < M && y[i] < M) {
        mat[x[i]][y[i]] = max(mat[x[i]][y[i]], vec[i - 1].second);
      }
 
      //
      xs.emplace_back(x[i], i);
      ys.emplace_back(y[i], i);
      zs.emplace_back(z[i], i);
    }
 
    for(int i = 0; i < M; i++) {
      for(int j = 0; j < M; j++) {
        if(i - 1 >= 0) {
          mat[i][j] = max(mat[i][j], mat[i - 1][j]);
        }
 
        if(j - 1 >= 0) {
          mat[i][j] = max(mat[i][j], mat[i][j - 1]);
        }
      }
    }
 
    sort(rall(xs));
    sort(rall(ys));
    sort(rall(zs));
 
    long long answ = -1;
    for(int i = 0; i < n; i++) {
      for(int j = 0; j < n; j++) {
        int xx = xs[i].second, yy = ys[j].second;
        if(x[xx] <= x[yy]) {
          continue;
        }
        
        if(y[yy] <= y[xx]) {
          continue;
        }
 
        int mx_z = 0;
        if(x[xx] && y[yy]) {
          mx_z = mat[x[xx] - 1][y[yy] - 1];
        }
 
        if(mx_z && mx_z > z[xx] && mx_z > z[yy] && values_x[x[xx] - 1] + values_y[y[yy] - 1] + mx_z > answ) {
          answ = max(answ, values_x[x[xx] - 1] + values_y[y[yy] - 1] + mx_z);
        }
      }
    }
 
    cout << answ << '\n';
  } else {
    
    for(int i = 1; i <= n; i++) {
      vecc.push_back({x[i], i});

      //
      sty.insert({y[i], i});
      stz.insert({z[i], i});
    }

    sort(rall(vecc));

    long long answ = -1;
    for(int i = 0; i < n; i++) {
      int j = i;
      // del(vecc[j].second);
      while(j < n && vecc[i].first == vecc[j].first) {
        del(vecc[j].second);
        j++;
      }

      while (sz(sty) && sz(stz)) {
        auto yy = *sty.rbegin();
        auto zz = *stz.rbegin();

        if(z[yy.second] == zz.first) {
          del(yy.second);
        } else if(y[zz.second] == yy.first) {
          del(zz.second);
        } else {
          break;
        }
      }

      int my = -1, mz = -1;
      if(sz(sty) && sz(stz)) {
        my = sty.rbegin()->first;
        mz = stz.rbegin()->first;
      }

      for(int k = i; k < j; k++) {
        int ind = vecc[k].second;
        if(k < n && my > y[ind] && mz > z[ind]) {
          answ = max(answ, x[ind] + my + mz);
        }
      }
      
      i = j - 1;
    }

    cout << answ << endl;

  }
}
 
int main() {
  //setIO();
 
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

team.cpp: In function 'void setIO(std::string)':
team.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
team.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 196376 KB Output is correct
2 Correct 195 ms 196388 KB Output is correct
3 Correct 182 ms 196300 KB Output is correct
4 Correct 189 ms 196344 KB Output is correct
5 Correct 186 ms 196276 KB Output is correct
6 Correct 180 ms 196296 KB Output is correct
7 Correct 250 ms 196372 KB Output is correct
8 Correct 195 ms 196360 KB Output is correct
9 Correct 190 ms 196392 KB Output is correct
10 Correct 191 ms 196420 KB Output is correct
11 Correct 204 ms 196284 KB Output is correct
12 Correct 205 ms 196444 KB Output is correct
13 Correct 184 ms 196288 KB Output is correct
14 Correct 194 ms 196452 KB Output is correct
15 Correct 188 ms 196416 KB Output is correct
16 Correct 192 ms 196396 KB Output is correct
17 Correct 230 ms 196416 KB Output is correct
18 Correct 186 ms 196428 KB Output is correct
19 Correct 188 ms 196456 KB Output is correct
20 Correct 233 ms 196396 KB Output is correct
21 Correct 186 ms 196364 KB Output is correct
22 Correct 188 ms 196368 KB Output is correct
23 Correct 208 ms 196368 KB Output is correct
24 Correct 207 ms 196424 KB Output is correct
25 Correct 191 ms 196396 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 196376 KB Output is correct
2 Correct 195 ms 196388 KB Output is correct
3 Correct 182 ms 196300 KB Output is correct
4 Correct 189 ms 196344 KB Output is correct
5 Correct 186 ms 196276 KB Output is correct
6 Correct 180 ms 196296 KB Output is correct
7 Correct 250 ms 196372 KB Output is correct
8 Correct 195 ms 196360 KB Output is correct
9 Correct 190 ms 196392 KB Output is correct
10 Correct 191 ms 196420 KB Output is correct
11 Correct 204 ms 196284 KB Output is correct
12 Correct 205 ms 196444 KB Output is correct
13 Correct 184 ms 196288 KB Output is correct
14 Correct 194 ms 196452 KB Output is correct
15 Correct 188 ms 196416 KB Output is correct
16 Correct 192 ms 196396 KB Output is correct
17 Correct 230 ms 196416 KB Output is correct
18 Correct 186 ms 196428 KB Output is correct
19 Correct 188 ms 196456 KB Output is correct
20 Correct 233 ms 196396 KB Output is correct
21 Correct 186 ms 196364 KB Output is correct
22 Correct 188 ms 196368 KB Output is correct
23 Correct 208 ms 196368 KB Output is correct
24 Correct 207 ms 196424 KB Output is correct
25 Correct 191 ms 196396 KB Output is correct
26 Correct 270 ms 196856 KB Output is correct
27 Correct 240 ms 196972 KB Output is correct
28 Correct 252 ms 196840 KB Output is correct
29 Correct 229 ms 196940 KB Output is correct
30 Correct 208 ms 196736 KB Output is correct
31 Correct 238 ms 196936 KB Output is correct
32 Correct 233 ms 197008 KB Output is correct
33 Correct 203 ms 196808 KB Output is correct
34 Correct 219 ms 196960 KB Output is correct
35 Correct 193 ms 196440 KB Output is correct
36 Correct 190 ms 196708 KB Output is correct
37 Correct 232 ms 196936 KB Output is correct
38 Correct 209 ms 196976 KB Output is correct
39 Correct 211 ms 196632 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 196288 KB Output is correct
2 Correct 206 ms 196292 KB Output is correct
3 Correct 193 ms 196300 KB Output is correct
4 Correct 191 ms 196380 KB Output is correct
5 Correct 210 ms 196332 KB Output is correct
6 Correct 225 ms 196300 KB Output is correct
7 Correct 197 ms 196312 KB Output is correct
8 Correct 189 ms 196332 KB Output is correct
9 Correct 189 ms 196388 KB Output is correct
10 Correct 200 ms 196384 KB Output is correct
11 Correct 228 ms 30732 KB Output is correct
12 Correct 151 ms 20676 KB Output is correct
13 Correct 169 ms 25460 KB Output is correct
14 Correct 228 ms 30852 KB Output is correct
15 Correct 179 ms 30856 KB Output is correct
16 Correct 189 ms 30764 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 196288 KB Output is correct
2 Correct 206 ms 196292 KB Output is correct
3 Correct 193 ms 196300 KB Output is correct
4 Correct 191 ms 196380 KB Output is correct
5 Correct 210 ms 196332 KB Output is correct
6 Correct 225 ms 196300 KB Output is correct
7 Correct 197 ms 196312 KB Output is correct
8 Correct 189 ms 196332 KB Output is correct
9 Correct 189 ms 196388 KB Output is correct
10 Correct 200 ms 196384 KB Output is correct
11 Correct 228 ms 30732 KB Output is correct
12 Correct 151 ms 20676 KB Output is correct
13 Correct 169 ms 25460 KB Output is correct
14 Correct 228 ms 30852 KB Output is correct
15 Correct 179 ms 30856 KB Output is correct
16 Correct 189 ms 30764 KB Output is correct
17 Correct 202 ms 196276 KB Output is correct
18 Correct 206 ms 196516 KB Output is correct
19 Correct 209 ms 196380 KB Output is correct
20 Correct 231 ms 196428 KB Output is correct
21 Correct 220 ms 196572 KB Output is correct
22 Correct 355 ms 30956 KB Output is correct
23 Correct 283 ms 30136 KB Output is correct
24 Correct 231 ms 22460 KB Output is correct
25 Correct 285 ms 30804 KB Output is correct
26 Correct 190 ms 30928 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 196288 KB Output is correct
2 Correct 206 ms 196292 KB Output is correct
3 Correct 193 ms 196300 KB Output is correct
4 Correct 191 ms 196380 KB Output is correct
5 Correct 210 ms 196332 KB Output is correct
6 Correct 225 ms 196300 KB Output is correct
7 Correct 197 ms 196312 KB Output is correct
8 Correct 189 ms 196332 KB Output is correct
9 Correct 189 ms 196388 KB Output is correct
10 Correct 200 ms 196384 KB Output is correct
11 Correct 228 ms 30732 KB Output is correct
12 Correct 151 ms 20676 KB Output is correct
13 Correct 169 ms 25460 KB Output is correct
14 Correct 228 ms 30852 KB Output is correct
15 Correct 179 ms 30856 KB Output is correct
16 Correct 189 ms 30764 KB Output is correct
17 Correct 202 ms 196276 KB Output is correct
18 Correct 206 ms 196516 KB Output is correct
19 Correct 209 ms 196380 KB Output is correct
20 Correct 231 ms 196428 KB Output is correct
21 Correct 220 ms 196572 KB Output is correct
22 Correct 355 ms 30956 KB Output is correct
23 Correct 283 ms 30136 KB Output is correct
24 Correct 231 ms 22460 KB Output is correct
25 Correct 285 ms 30804 KB Output is correct
26 Correct 190 ms 30928 KB Output is correct
27 Correct 187 ms 196388 KB Output is correct
28 Correct 181 ms 196516 KB Output is correct
29 Correct 200 ms 196444 KB Output is correct
30 Correct 182 ms 196424 KB Output is correct
31 Correct 220 ms 196940 KB Output is correct
32 Correct 193 ms 196436 KB Output is correct
33 Correct 191 ms 196452 KB Output is correct
34 Correct 476 ms 30000 KB Output is correct
35 Correct 478 ms 29364 KB Output is correct
36 Correct 460 ms 30860 KB Output is correct
37 Correct 376 ms 30688 KB Output is correct
38 Correct 219 ms 30288 KB Output is correct
39 Correct 132 ms 18592 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 196288 KB Output is correct
2 Correct 206 ms 196292 KB Output is correct
3 Correct 193 ms 196300 KB Output is correct
4 Correct 191 ms 196380 KB Output is correct
5 Correct 210 ms 196332 KB Output is correct
6 Correct 225 ms 196300 KB Output is correct
7 Correct 197 ms 196312 KB Output is correct
8 Correct 189 ms 196332 KB Output is correct
9 Correct 189 ms 196388 KB Output is correct
10 Correct 200 ms 196384 KB Output is correct
11 Correct 228 ms 30732 KB Output is correct
12 Correct 151 ms 20676 KB Output is correct
13 Correct 169 ms 25460 KB Output is correct
14 Correct 228 ms 30852 KB Output is correct
15 Correct 179 ms 30856 KB Output is correct
16 Correct 189 ms 30764 KB Output is correct
17 Correct 202 ms 196276 KB Output is correct
18 Correct 206 ms 196516 KB Output is correct
19 Correct 209 ms 196380 KB Output is correct
20 Correct 231 ms 196428 KB Output is correct
21 Correct 220 ms 196572 KB Output is correct
22 Correct 355 ms 30956 KB Output is correct
23 Correct 283 ms 30136 KB Output is correct
24 Correct 231 ms 22460 KB Output is correct
25 Correct 285 ms 30804 KB Output is correct
26 Correct 190 ms 30928 KB Output is correct
27 Correct 187 ms 196388 KB Output is correct
28 Correct 181 ms 196516 KB Output is correct
29 Correct 200 ms 196444 KB Output is correct
30 Correct 182 ms 196424 KB Output is correct
31 Correct 220 ms 196940 KB Output is correct
32 Correct 193 ms 196436 KB Output is correct
33 Correct 191 ms 196452 KB Output is correct
34 Correct 476 ms 30000 KB Output is correct
35 Correct 478 ms 29364 KB Output is correct
36 Correct 460 ms 30860 KB Output is correct
37 Correct 376 ms 30688 KB Output is correct
38 Correct 219 ms 30288 KB Output is correct
39 Correct 132 ms 18592 KB Output is correct
40 Correct 220 ms 196840 KB Output is correct
41 Correct 224 ms 197044 KB Output is correct
42 Correct 212 ms 196940 KB Output is correct
43 Correct 226 ms 196824 KB Output is correct
44 Correct 632 ms 30864 KB Output is correct
45 Correct 458 ms 33036 KB Output is correct
46 Correct 503 ms 32860 KB Output is correct
47 Correct 463 ms 33024 KB Output is correct
48 Correct 316 ms 32760 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 196376 KB Output is correct
2 Correct 195 ms 196388 KB Output is correct
3 Correct 182 ms 196300 KB Output is correct
4 Correct 189 ms 196344 KB Output is correct
5 Correct 186 ms 196276 KB Output is correct
6 Correct 180 ms 196296 KB Output is correct
7 Correct 250 ms 196372 KB Output is correct
8 Correct 195 ms 196360 KB Output is correct
9 Correct 190 ms 196392 KB Output is correct
10 Correct 191 ms 196420 KB Output is correct
11 Correct 204 ms 196284 KB Output is correct
12 Correct 205 ms 196444 KB Output is correct
13 Correct 184 ms 196288 KB Output is correct
14 Correct 194 ms 196452 KB Output is correct
15 Correct 188 ms 196416 KB Output is correct
16 Correct 192 ms 196396 KB Output is correct
17 Correct 230 ms 196416 KB Output is correct
18 Correct 186 ms 196428 KB Output is correct
19 Correct 188 ms 196456 KB Output is correct
20 Correct 233 ms 196396 KB Output is correct
21 Correct 186 ms 196364 KB Output is correct
22 Correct 188 ms 196368 KB Output is correct
23 Correct 208 ms 196368 KB Output is correct
24 Correct 207 ms 196424 KB Output is correct
25 Correct 191 ms 196396 KB Output is correct
26 Correct 270 ms 196856 KB Output is correct
27 Correct 240 ms 196972 KB Output is correct
28 Correct 252 ms 196840 KB Output is correct
29 Correct 229 ms 196940 KB Output is correct
30 Correct 208 ms 196736 KB Output is correct
31 Correct 238 ms 196936 KB Output is correct
32 Correct 233 ms 197008 KB Output is correct
33 Correct 203 ms 196808 KB Output is correct
34 Correct 219 ms 196960 KB Output is correct
35 Correct 193 ms 196440 KB Output is correct
36 Correct 190 ms 196708 KB Output is correct
37 Correct 232 ms 196936 KB Output is correct
38 Correct 209 ms 196976 KB Output is correct
39 Correct 211 ms 196632 KB Output is correct
40 Correct 191 ms 196288 KB Output is correct
41 Correct 206 ms 196292 KB Output is correct
42 Correct 193 ms 196300 KB Output is correct
43 Correct 191 ms 196380 KB Output is correct
44 Correct 210 ms 196332 KB Output is correct
45 Correct 225 ms 196300 KB Output is correct
46 Correct 197 ms 196312 KB Output is correct
47 Correct 189 ms 196332 KB Output is correct
48 Correct 189 ms 196388 KB Output is correct
49 Correct 200 ms 196384 KB Output is correct
50 Correct 228 ms 30732 KB Output is correct
51 Correct 151 ms 20676 KB Output is correct
52 Correct 169 ms 25460 KB Output is correct
53 Correct 228 ms 30852 KB Output is correct
54 Correct 179 ms 30856 KB Output is correct
55 Correct 189 ms 30764 KB Output is correct
56 Correct 202 ms 196276 KB Output is correct
57 Correct 206 ms 196516 KB Output is correct
58 Correct 209 ms 196380 KB Output is correct
59 Correct 231 ms 196428 KB Output is correct
60 Correct 220 ms 196572 KB Output is correct
61 Correct 355 ms 30956 KB Output is correct
62 Correct 283 ms 30136 KB Output is correct
63 Correct 231 ms 22460 KB Output is correct
64 Correct 285 ms 30804 KB Output is correct
65 Correct 190 ms 30928 KB Output is correct
66 Correct 187 ms 196388 KB Output is correct
67 Correct 181 ms 196516 KB Output is correct
68 Correct 200 ms 196444 KB Output is correct
69 Correct 182 ms 196424 KB Output is correct
70 Correct 220 ms 196940 KB Output is correct
71 Correct 193 ms 196436 KB Output is correct
72 Correct 191 ms 196452 KB Output is correct
73 Correct 476 ms 30000 KB Output is correct
74 Correct 478 ms 29364 KB Output is correct
75 Correct 460 ms 30860 KB Output is correct
76 Correct 376 ms 30688 KB Output is correct
77 Correct 219 ms 30288 KB Output is correct
78 Correct 132 ms 18592 KB Output is correct
79 Correct 220 ms 196840 KB Output is correct
80 Correct 224 ms 197044 KB Output is correct
81 Correct 212 ms 196940 KB Output is correct
82 Correct 226 ms 196824 KB Output is correct
83 Correct 632 ms 30864 KB Output is correct
84 Correct 458 ms 33036 KB Output is correct
85 Correct 503 ms 32860 KB Output is correct
86 Correct 463 ms 33024 KB Output is correct
87 Correct 316 ms 32760 KB Output is correct
88 Correct 642 ms 34852 KB Output is correct
89 Correct 528 ms 34904 KB Output is correct
90 Correct 636 ms 34772 KB Output is correct
91 Correct 537 ms 34740 KB Output is correct
92 Correct 545 ms 33220 KB Output is correct
93 Correct 519 ms 33640 KB Output is correct
94 Correct 495 ms 33396 KB Output is correct
95 Correct 329 ms 34756 KB Output is correct
96 Correct 368 ms 34872 KB Output is correct
97 Correct 284 ms 34776 KB Output is correct
98 Correct 252 ms 33600 KB Output is correct
99 Correct 239 ms 33524 KB Output is correct