oj.uz

Submission #721998

# Submission time Handle Problem Language Result Execution time Memory
721998 2023-04-11T10:09:00 Z Sam_a17 Team Contest (JOI22_team) C++17
37 / 100
 214 ms 106404 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 = 150005, M = 5005;
int x[N], y[N], z[N];
int n, mat[M][M];


bool marked[M][M];

void solve_() {
  cin >> n;

  vector<pair<long long, int>> xs, ys, zs;
  vector<pair<pair<long long, long long>, int>> 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++) {
      mat[x[i]][y[i]] = max(mat[x[i]][y[i]], z[i]);
      marked[x[i]][y[i]] = true;
    }
    
    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]);
        }
      }
    }

    int answ = -1;
    for(int i = 2; i < M; i++) {
      for(int j = M - 1; j >= 2; j--) {
        if(marked[i][j]) {
          answ = max(answ, i + j + mat[i - 1][j - 1]);
        }
      }
    }

    cout << answ << '\n';
  }
}
 
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 139 ms 98344 KB Output is correct
2 Correct 135 ms 98264 KB Output is correct
3 Correct 136 ms 98252 KB Output is correct
4 Correct 144 ms 98340 KB Output is correct
5 Correct 139 ms 98328 KB Output is correct
6 Correct 135 ms 98300 KB Output is correct
7 Correct 137 ms 98256 KB Output is correct
8 Correct 148 ms 98372 KB Output is correct
9 Correct 136 ms 98268 KB Output is correct
10 Correct 135 ms 98280 KB Output is correct
11 Correct 139 ms 98236 KB Output is correct
12 Correct 146 ms 98336 KB Output is correct
13 Correct 135 ms 98284 KB Output is correct
14 Correct 142 ms 98556 KB Output is correct
15 Correct 146 ms 98288 KB Output is correct
16 Correct 142 ms 98496 KB Output is correct
17 Correct 136 ms 98504 KB Output is correct
18 Correct 139 ms 98440 KB Output is correct
19 Correct 138 ms 98508 KB Output is correct
20 Correct 141 ms 98492 KB Output is correct
21 Correct 143 ms 98356 KB Output is correct
22 Correct 140 ms 98380 KB Output is correct
23 Correct 146 ms 98296 KB Output is correct
24 Correct 138 ms 98360 KB Output is correct
25 Correct 153 ms 98336 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 98344 KB Output is correct
2 Correct 135 ms 98264 KB Output is correct
3 Correct 136 ms 98252 KB Output is correct
4 Correct 144 ms 98340 KB Output is correct
5 Correct 139 ms 98328 KB Output is correct
6 Correct 135 ms 98300 KB Output is correct
7 Correct 137 ms 98256 KB Output is correct
8 Correct 148 ms 98372 KB Output is correct
9 Correct 136 ms 98268 KB Output is correct
10 Correct 135 ms 98280 KB Output is correct
11 Correct 139 ms 98236 KB Output is correct
12 Correct 146 ms 98336 KB Output is correct
13 Correct 135 ms 98284 KB Output is correct
14 Correct 142 ms 98556 KB Output is correct
15 Correct 146 ms 98288 KB Output is correct
16 Correct 142 ms 98496 KB Output is correct
17 Correct 136 ms 98504 KB Output is correct
18 Correct 139 ms 98440 KB Output is correct
19 Correct 138 ms 98508 KB Output is correct
20 Correct 141 ms 98492 KB Output is correct
21 Correct 143 ms 98356 KB Output is correct
22 Correct 140 ms 98380 KB Output is correct
23 Correct 146 ms 98296 KB Output is correct
24 Correct 138 ms 98360 KB Output is correct
25 Correct 153 ms 98336 KB Output is correct
26 Correct 200 ms 98764 KB Output is correct
27 Correct 194 ms 98952 KB Output is correct
28 Correct 192 ms 98860 KB Output is correct
29 Correct 170 ms 98860 KB Output is correct
30 Correct 159 ms 98836 KB Output is correct
31 Correct 214 ms 98756 KB Output is correct
32 Correct 169 ms 98852 KB Output is correct
33 Correct 161 ms 98764 KB Output is correct
34 Correct 167 ms 98896 KB Output is correct
35 Correct 138 ms 98420 KB Output is correct
36 Correct 137 ms 98412 KB Output is correct
37 Correct 154 ms 98796 KB Output is correct
38 Correct 176 ms 98788 KB Output is correct
39 Correct 145 ms 98520 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 98348 KB Output is correct
2 Correct 152 ms 98300 KB Output is correct
3 Correct 139 ms 98352 KB Output is correct
4 Correct 137 ms 98276 KB Output is correct
5 Correct 137 ms 98280 KB Output is correct
6 Correct 150 ms 98296 KB Output is correct
7 Correct 137 ms 98296 KB Output is correct
8 Correct 136 ms 98364 KB Output is correct
9 Correct 139 ms 98368 KB Output is correct
10 Correct 139 ms 98288 KB Output is correct
11 Correct 191 ms 106404 KB Output is correct
12 Incorrect 172 ms 103988 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 98348 KB Output is correct
2 Correct 152 ms 98300 KB Output is correct
3 Correct 139 ms 98352 KB Output is correct
4 Correct 137 ms 98276 KB Output is correct
5 Correct 137 ms 98280 KB Output is correct
6 Correct 150 ms 98296 KB Output is correct
7 Correct 137 ms 98296 KB Output is correct
8 Correct 136 ms 98364 KB Output is correct
9 Correct 139 ms 98368 KB Output is correct
10 Correct 139 ms 98288 KB Output is correct
11 Correct 191 ms 106404 KB Output is correct
12 Incorrect 172 ms 103988 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 98348 KB Output is correct
2 Correct 152 ms 98300 KB Output is correct
3 Correct 139 ms 98352 KB Output is correct
4 Correct 137 ms 98276 KB Output is correct
5 Correct 137 ms 98280 KB Output is correct
6 Correct 150 ms 98296 KB Output is correct
7 Correct 137 ms 98296 KB Output is correct
8 Correct 136 ms 98364 KB Output is correct
9 Correct 139 ms 98368 KB Output is correct
10 Correct 139 ms 98288 KB Output is correct
11 Correct 191 ms 106404 KB Output is correct
12 Incorrect 172 ms 103988 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 98348 KB Output is correct
2 Correct 152 ms 98300 KB Output is correct
3 Correct 139 ms 98352 KB Output is correct
4 Correct 137 ms 98276 KB Output is correct
5 Correct 137 ms 98280 KB Output is correct
6 Correct 150 ms 98296 KB Output is correct
7 Correct 137 ms 98296 KB Output is correct
8 Correct 136 ms 98364 KB Output is correct
9 Correct 139 ms 98368 KB Output is correct
10 Correct 139 ms 98288 KB Output is correct
11 Correct 191 ms 106404 KB Output is correct
12 Incorrect 172 ms 103988 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 98344 KB Output is correct
2 Correct 135 ms 98264 KB Output is correct
3 Correct 136 ms 98252 KB Output is correct
4 Correct 144 ms 98340 KB Output is correct
5 Correct 139 ms 98328 KB Output is correct
6 Correct 135 ms 98300 KB Output is correct
7 Correct 137 ms 98256 KB Output is correct
8 Correct 148 ms 98372 KB Output is correct
9 Correct 136 ms 98268 KB Output is correct
10 Correct 135 ms 98280 KB Output is correct
11 Correct 139 ms 98236 KB Output is correct
12 Correct 146 ms 98336 KB Output is correct
13 Correct 135 ms 98284 KB Output is correct
14 Correct 142 ms 98556 KB Output is correct
15 Correct 146 ms 98288 KB Output is correct
16 Correct 142 ms 98496 KB Output is correct
17 Correct 136 ms 98504 KB Output is correct
18 Correct 139 ms 98440 KB Output is correct
19 Correct 138 ms 98508 KB Output is correct
20 Correct 141 ms 98492 KB Output is correct
21 Correct 143 ms 98356 KB Output is correct
22 Correct 140 ms 98380 KB Output is correct
23 Correct 146 ms 98296 KB Output is correct
24 Correct 138 ms 98360 KB Output is correct
25 Correct 153 ms 98336 KB Output is correct
26 Correct 200 ms 98764 KB Output is correct
27 Correct 194 ms 98952 KB Output is correct
28 Correct 192 ms 98860 KB Output is correct
29 Correct 170 ms 98860 KB Output is correct
30 Correct 159 ms 98836 KB Output is correct
31 Correct 214 ms 98756 KB Output is correct
32 Correct 169 ms 98852 KB Output is correct
33 Correct 161 ms 98764 KB Output is correct
34 Correct 167 ms 98896 KB Output is correct
35 Correct 138 ms 98420 KB Output is correct
36 Correct 137 ms 98412 KB Output is correct
37 Correct 154 ms 98796 KB Output is correct
38 Correct 176 ms 98788 KB Output is correct
39 Correct 145 ms 98520 KB Output is correct
40 Correct 144 ms 98348 KB Output is correct
41 Correct 152 ms 98300 KB Output is correct
42 Correct 139 ms 98352 KB Output is correct
43 Correct 137 ms 98276 KB Output is correct
44 Correct 137 ms 98280 KB Output is correct
45 Correct 150 ms 98296 KB Output is correct
46 Correct 137 ms 98296 KB Output is correct
47 Correct 136 ms 98364 KB Output is correct
48 Correct 139 ms 98368 KB Output is correct
49 Correct 139 ms 98288 KB Output is correct
50 Correct 191 ms 106404 KB Output is correct
51 Incorrect 172 ms 103988 KB Output isn't correct
52 Halted 0 ms 0 KB -