oj.uz

Submission #721956

# Submission time Handle Problem Language Result Execution time Memory
721956 2023-04-11T09:15:13 Z Sam_a17 Team Contest (JOI22_team) C++17
0 / 100
 103 ms 63064 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 = 4004;
int x[N], y[N], z[N];
int n, mat[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;
  for(int i = 1; i <= n; i++) {
    cin >> x[i] >> y[i] >> z[i];

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

  sort(all(vec));
  uniq(vec);

  sort(all(values));
  uniq(values);

  n = sz(vec);

  auto get = [&](long long val)-> int { 
    return lower_bound(all(values), val) - values.begin();
  };

  for(int i = 1; i <= n; i++) {
    x[i] = get(vec[i - 1].first.first);
    y[i] = get(vec[i - 1].first.second);
    z[i] = get(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));

  assert(sz(xs) == n);

  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]) {
        answ = max(answ, values[x[xx]] + values[y[yy]] + mx_z);
      }
    }
  }

  if(n > 10) {
    assert(answ != -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
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 63052 KB Output is correct
2 Correct 88 ms 62956 KB Output is correct
3 Correct 87 ms 63048 KB Output is correct
4 Correct 100 ms 63036 KB Output is correct
5 Correct 96 ms 62992 KB Output is correct
6 Correct 92 ms 63020 KB Output is correct
7 Correct 90 ms 63052 KB Output is correct
8 Correct 93 ms 62956 KB Output is correct
9 Correct 102 ms 62980 KB Output is correct
10 Incorrect 95 ms 63028 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 63052 KB Output is correct
2 Correct 88 ms 62956 KB Output is correct
3 Correct 87 ms 63048 KB Output is correct
4 Correct 100 ms 63036 KB Output is correct
5 Correct 96 ms 62992 KB Output is correct
6 Correct 92 ms 63020 KB Output is correct
7 Correct 90 ms 63052 KB Output is correct
8 Correct 93 ms 62956 KB Output is correct
9 Correct 102 ms 62980 KB Output is correct
10 Incorrect 95 ms 63028 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 62948 KB Output is correct
2 Correct 91 ms 63028 KB Output is correct
3 Correct 103 ms 63020 KB Output is correct
4 Correct 93 ms 63048 KB Output is correct
5 Correct 90 ms 63016 KB Output is correct
6 Correct 89 ms 63024 KB Output is correct
7 Correct 91 ms 63064 KB Output is correct
8 Correct 94 ms 62956 KB Output is correct
9 Correct 95 ms 63052 KB Output is correct
10 Incorrect 91 ms 63000 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 62948 KB Output is correct
2 Correct 91 ms 63028 KB Output is correct
3 Correct 103 ms 63020 KB Output is correct
4 Correct 93 ms 63048 KB Output is correct
5 Correct 90 ms 63016 KB Output is correct
6 Correct 89 ms 63024 KB Output is correct
7 Correct 91 ms 63064 KB Output is correct
8 Correct 94 ms 62956 KB Output is correct
9 Correct 95 ms 63052 KB Output is correct
10 Incorrect 91 ms 63000 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 62948 KB Output is correct
2 Correct 91 ms 63028 KB Output is correct
3 Correct 103 ms 63020 KB Output is correct
4 Correct 93 ms 63048 KB Output is correct
5 Correct 90 ms 63016 KB Output is correct
6 Correct 89 ms 63024 KB Output is correct
7 Correct 91 ms 63064 KB Output is correct
8 Correct 94 ms 62956 KB Output is correct
9 Correct 95 ms 63052 KB Output is correct
10 Incorrect 91 ms 63000 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 62948 KB Output is correct
2 Correct 91 ms 63028 KB Output is correct
3 Correct 103 ms 63020 KB Output is correct
4 Correct 93 ms 63048 KB Output is correct
5 Correct 90 ms 63016 KB Output is correct
6 Correct 89 ms 63024 KB Output is correct
7 Correct 91 ms 63064 KB Output is correct
8 Correct 94 ms 62956 KB Output is correct
9 Correct 95 ms 63052 KB Output is correct
10 Incorrect 91 ms 63000 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 63052 KB Output is correct
2 Correct 88 ms 62956 KB Output is correct
3 Correct 87 ms 63048 KB Output is correct
4 Correct 100 ms 63036 KB Output is correct
5 Correct 96 ms 62992 KB Output is correct
6 Correct 92 ms 63020 KB Output is correct
7 Correct 90 ms 63052 KB Output is correct
8 Correct 93 ms 62956 KB Output is correct
9 Correct 102 ms 62980 KB Output is correct
10 Incorrect 95 ms 63028 KB Output isn't correct
11 Halted 0 ms 0 KB -