oj.uz

답안 #722047

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
722047 2023-04-11T10:57:42 Z Sam_a17 Team Contest (JOI22_team) C++17
64 / 100
 2000 ms 105596 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];

map<int, vector<pair<int, int>>> mp;
bool marked[M][M];

// bit
struct fenwick {
  int size;
  vector<long long> tree; 

  void init(int size_) {
    tree.assign(size_ + 2, 0);
    size = size_;
  }

  void upd(int u, long long v) {
    while(u <= size) {
      tree[u] = max(tree[u], v);
      u += u & (-u);
    }
  }

  long long qry(int u) {
    long long sum = 0;
    while(u > 0) {
      sum = max(sum, tree[u]);
      u -= u & (-u); // lsb
    }
    return sum;
  }

  long long sum(int l, int r) {
    return qry(r) - qry(l - 1);
  }

} seg_max;

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 {


    vector<bool> mar(M);
    vector<int> mn(M, INT32_MAX);

    seg_max.init(M + 1);
    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;
      mp[x[i]].push_back({y[i], z[i]});
    }
    
    int answ = -1;
    for(auto i: mp) {
      for(auto j: i.second) {
        for(int k = j.first + 1; k < M; k++) {
          if(!mar[k]) continue;
          int new_z = seg_max.qry(k - 1);
          if(new_z <= j.second) continue;
          if(new_z <= mn[k]) continue;
          answ = max(answ, i.first + k + new_z);
        }
      }

      for(auto j: i.second) {
        mar[j.first] = true;
        mn[j.first] = min(mn[j.first], j.second);
        seg_max.upd(j.first, j.second);
      }
    }

    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

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 98252 KB Output is correct
2 Correct 130 ms 98340 KB Output is correct
3 Correct 130 ms 98252 KB Output is correct
4 Correct 133 ms 98360 KB Output is correct
5 Correct 133 ms 98240 KB Output is correct
6 Correct 131 ms 98300 KB Output is correct
7 Correct 131 ms 98320 KB Output is correct
8 Correct 131 ms 98356 KB Output is correct
9 Correct 139 ms 98240 KB Output is correct
10 Correct 131 ms 98324 KB Output is correct
11 Correct 148 ms 98264 KB Output is correct
12 Correct 140 ms 98348 KB Output is correct
13 Correct 145 ms 98364 KB Output is correct
14 Correct 143 ms 98380 KB Output is correct
15 Correct 142 ms 98384 KB Output is correct
16 Correct 149 ms 98508 KB Output is correct
17 Correct 144 ms 98380 KB Output is correct
18 Correct 148 ms 98344 KB Output is correct
19 Correct 136 ms 98400 KB Output is correct
20 Correct 138 ms 98336 KB Output is correct
21 Correct 134 ms 98332 KB Output is correct
22 Correct 139 ms 98476 KB Output is correct
23 Correct 135 ms 98384 KB Output is correct
24 Correct 142 ms 98416 KB Output is correct
25 Correct 142 ms 98344 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 98252 KB Output is correct
2 Correct 130 ms 98340 KB Output is correct
3 Correct 130 ms 98252 KB Output is correct
4 Correct 133 ms 98360 KB Output is correct
5 Correct 133 ms 98240 KB Output is correct
6 Correct 131 ms 98300 KB Output is correct
7 Correct 131 ms 98320 KB Output is correct
8 Correct 131 ms 98356 KB Output is correct
9 Correct 139 ms 98240 KB Output is correct
10 Correct 131 ms 98324 KB Output is correct
11 Correct 148 ms 98264 KB Output is correct
12 Correct 140 ms 98348 KB Output is correct
13 Correct 145 ms 98364 KB Output is correct
14 Correct 143 ms 98380 KB Output is correct
15 Correct 142 ms 98384 KB Output is correct
16 Correct 149 ms 98508 KB Output is correct
17 Correct 144 ms 98380 KB Output is correct
18 Correct 148 ms 98344 KB Output is correct
19 Correct 136 ms 98400 KB Output is correct
20 Correct 138 ms 98336 KB Output is correct
21 Correct 134 ms 98332 KB Output is correct
22 Correct 139 ms 98476 KB Output is correct
23 Correct 135 ms 98384 KB Output is correct
24 Correct 142 ms 98416 KB Output is correct
25 Correct 142 ms 98344 KB Output is correct
26 Correct 201 ms 98900 KB Output is correct
27 Correct 190 ms 98892 KB Output is correct
28 Correct 185 ms 98776 KB Output is correct
29 Correct 183 ms 98852 KB Output is correct
30 Correct 157 ms 98724 KB Output is correct
31 Correct 193 ms 98848 KB Output is correct
32 Correct 173 ms 98740 KB Output is correct
33 Correct 147 ms 98784 KB Output is correct
34 Correct 157 ms 98852 KB Output is correct
35 Correct 135 ms 98452 KB Output is correct
36 Correct 138 ms 98448 KB Output is correct
37 Correct 153 ms 98848 KB Output is correct
38 Correct 155 ms 98924 KB Output is correct
39 Correct 143 ms 98628 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 98324 KB Output is correct
2 Correct 135 ms 98248 KB Output is correct
3 Correct 142 ms 98384 KB Output is correct
4 Correct 133 ms 98336 KB Output is correct
5 Correct 137 ms 98252 KB Output is correct
6 Correct 140 ms 98248 KB Output is correct
7 Correct 137 ms 98364 KB Output is correct
8 Correct 138 ms 98368 KB Output is correct
9 Correct 140 ms 98252 KB Output is correct
10 Correct 136 ms 98312 KB Output is correct
11 Correct 552 ms 10536 KB Output is correct
12 Correct 363 ms 7092 KB Output is correct
13 Correct 448 ms 8352 KB Output is correct
14 Correct 553 ms 10480 KB Output is correct
15 Correct 551 ms 10844 KB Output is correct
16 Correct 543 ms 11308 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 98324 KB Output is correct
2 Correct 135 ms 98248 KB Output is correct
3 Correct 142 ms 98384 KB Output is correct
4 Correct 133 ms 98336 KB Output is correct
5 Correct 137 ms 98252 KB Output is correct
6 Correct 140 ms 98248 KB Output is correct
7 Correct 137 ms 98364 KB Output is correct
8 Correct 138 ms 98368 KB Output is correct
9 Correct 140 ms 98252 KB Output is correct
10 Correct 136 ms 98312 KB Output is correct
11 Correct 552 ms 10536 KB Output is correct
12 Correct 363 ms 7092 KB Output is correct
13 Correct 448 ms 8352 KB Output is correct
14 Correct 553 ms 10480 KB Output is correct
15 Correct 551 ms 10844 KB Output is correct
16 Correct 543 ms 11308 KB Output is correct
17 Correct 134 ms 98276 KB Output is correct
18 Correct 135 ms 98244 KB Output is correct
19 Correct 143 ms 98360 KB Output is correct
20 Correct 137 ms 98296 KB Output is correct
21 Correct 141 ms 98508 KB Output is correct
22 Correct 571 ms 10476 KB Output is correct
23 Correct 538 ms 10468 KB Output is correct
24 Correct 419 ms 7396 KB Output is correct
25 Correct 562 ms 10468 KB Output is correct
26 Correct 555 ms 10936 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 98324 KB Output is correct
2 Correct 135 ms 98248 KB Output is correct
3 Correct 142 ms 98384 KB Output is correct
4 Correct 133 ms 98336 KB Output is correct
5 Correct 137 ms 98252 KB Output is correct
6 Correct 140 ms 98248 KB Output is correct
7 Correct 137 ms 98364 KB Output is correct
8 Correct 138 ms 98368 KB Output is correct
9 Correct 140 ms 98252 KB Output is correct
10 Correct 136 ms 98312 KB Output is correct
11 Correct 552 ms 10536 KB Output is correct
12 Correct 363 ms 7092 KB Output is correct
13 Correct 448 ms 8352 KB Output is correct
14 Correct 553 ms 10480 KB Output is correct
15 Correct 551 ms 10844 KB Output is correct
16 Correct 543 ms 11308 KB Output is correct
17 Correct 134 ms 98276 KB Output is correct
18 Correct 135 ms 98244 KB Output is correct
19 Correct 143 ms 98360 KB Output is correct
20 Correct 137 ms 98296 KB Output is correct
21 Correct 141 ms 98508 KB Output is correct
22 Correct 571 ms 10476 KB Output is correct
23 Correct 538 ms 10468 KB Output is correct
24 Correct 419 ms 7396 KB Output is correct
25 Correct 562 ms 10468 KB Output is correct
26 Correct 555 ms 10936 KB Output is correct
27 Correct 136 ms 98352 KB Output is correct
28 Correct 136 ms 98504 KB Output is correct
29 Correct 139 ms 98396 KB Output is correct
30 Correct 135 ms 98408 KB Output is correct
31 Correct 171 ms 98860 KB Output is correct
32 Correct 137 ms 98440 KB Output is correct
33 Correct 136 ms 98464 KB Output is correct
34 Correct 639 ms 12052 KB Output is correct
35 Correct 606 ms 12172 KB Output is correct
36 Correct 678 ms 12736 KB Output is correct
37 Correct 607 ms 12528 KB Output is correct
38 Correct 522 ms 13000 KB Output is correct
39 Correct 318 ms 6744 KB Output is correct

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 98324 KB Output is correct
2 Correct 135 ms 98248 KB Output is correct
3 Correct 142 ms 98384 KB Output is correct
4 Correct 133 ms 98336 KB Output is correct
5 Correct 137 ms 98252 KB Output is correct
6 Correct 140 ms 98248 KB Output is correct
7 Correct 137 ms 98364 KB Output is correct
8 Correct 138 ms 98368 KB Output is correct
9 Correct 140 ms 98252 KB Output is correct
10 Correct 136 ms 98312 KB Output is correct
11 Correct 552 ms 10536 KB Output is correct
12 Correct 363 ms 7092 KB Output is correct
13 Correct 448 ms 8352 KB Output is correct
14 Correct 553 ms 10480 KB Output is correct
15 Correct 551 ms 10844 KB Output is correct
16 Correct 543 ms 11308 KB Output is correct
17 Correct 134 ms 98276 KB Output is correct
18 Correct 135 ms 98244 KB Output is correct
19 Correct 143 ms 98360 KB Output is correct
20 Correct 137 ms 98296 KB Output is correct
21 Correct 141 ms 98508 KB Output is correct
22 Correct 571 ms 10476 KB Output is correct
23 Correct 538 ms 10468 KB Output is correct
24 Correct 419 ms 7396 KB Output is correct
25 Correct 562 ms 10468 KB Output is correct
26 Correct 555 ms 10936 KB Output is correct
27 Correct 136 ms 98352 KB Output is correct
28 Correct 136 ms 98504 KB Output is correct
29 Correct 139 ms 98396 KB Output is correct
30 Correct 135 ms 98408 KB Output is correct
31 Correct 171 ms 98860 KB Output is correct
32 Correct 137 ms 98440 KB Output is correct
33 Correct 136 ms 98464 KB Output is correct
34 Correct 639 ms 12052 KB Output is correct
35 Correct 606 ms 12172 KB Output is correct
36 Correct 678 ms 12736 KB Output is correct
37 Correct 607 ms 12528 KB Output is correct
38 Correct 522 ms 13000 KB Output is correct
39 Correct 318 ms 6744 KB Output is correct
40 Correct 158 ms 98772 KB Output is correct
41 Correct 190 ms 98932 KB Output is correct
42 Correct 154 ms 98800 KB Output is correct
43 Correct 156 ms 98812 KB Output is correct
44 Execution timed out 2084 ms 105596 KB Time limit exceeded
45 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 98252 KB Output is correct
2 Correct 130 ms 98340 KB Output is correct
3 Correct 130 ms 98252 KB Output is correct
4 Correct 133 ms 98360 KB Output is correct
5 Correct 133 ms 98240 KB Output is correct
6 Correct 131 ms 98300 KB Output is correct
7 Correct 131 ms 98320 KB Output is correct
8 Correct 131 ms 98356 KB Output is correct
9 Correct 139 ms 98240 KB Output is correct
10 Correct 131 ms 98324 KB Output is correct
11 Correct 148 ms 98264 KB Output is correct
12 Correct 140 ms 98348 KB Output is correct
13 Correct 145 ms 98364 KB Output is correct
14 Correct 143 ms 98380 KB Output is correct
15 Correct 142 ms 98384 KB Output is correct
16 Correct 149 ms 98508 KB Output is correct
17 Correct 144 ms 98380 KB Output is correct
18 Correct 148 ms 98344 KB Output is correct
19 Correct 136 ms 98400 KB Output is correct
20 Correct 138 ms 98336 KB Output is correct
21 Correct 134 ms 98332 KB Output is correct
22 Correct 139 ms 98476 KB Output is correct
23 Correct 135 ms 98384 KB Output is correct
24 Correct 142 ms 98416 KB Output is correct
25 Correct 142 ms 98344 KB Output is correct
26 Correct 201 ms 98900 KB Output is correct
27 Correct 190 ms 98892 KB Output is correct
28 Correct 185 ms 98776 KB Output is correct
29 Correct 183 ms 98852 KB Output is correct
30 Correct 157 ms 98724 KB Output is correct
31 Correct 193 ms 98848 KB Output is correct
32 Correct 173 ms 98740 KB Output is correct
33 Correct 147 ms 98784 KB Output is correct
34 Correct 157 ms 98852 KB Output is correct
35 Correct 135 ms 98452 KB Output is correct
36 Correct 138 ms 98448 KB Output is correct
37 Correct 153 ms 98848 KB Output is correct
38 Correct 155 ms 98924 KB Output is correct
39 Correct 143 ms 98628 KB Output is correct
40 Correct 135 ms 98324 KB Output is correct
41 Correct 135 ms 98248 KB Output is correct
42 Correct 142 ms 98384 KB Output is correct
43 Correct 133 ms 98336 KB Output is correct
44 Correct 137 ms 98252 KB Output is correct
45 Correct 140 ms 98248 KB Output is correct
46 Correct 137 ms 98364 KB Output is correct
47 Correct 138 ms 98368 KB Output is correct
48 Correct 140 ms 98252 KB Output is correct
49 Correct 136 ms 98312 KB Output is correct
50 Correct 552 ms 10536 KB Output is correct
51 Correct 363 ms 7092 KB Output is correct
52 Correct 448 ms 8352 KB Output is correct
53 Correct 553 ms 10480 KB Output is correct
54 Correct 551 ms 10844 KB Output is correct
55 Correct 543 ms 11308 KB Output is correct
56 Correct 134 ms 98276 KB Output is correct
57 Correct 135 ms 98244 KB Output is correct
58 Correct 143 ms 98360 KB Output is correct
59 Correct 137 ms 98296 KB Output is correct
60 Correct 141 ms 98508 KB Output is correct
61 Correct 571 ms 10476 KB Output is correct
62 Correct 538 ms 10468 KB Output is correct
63 Correct 419 ms 7396 KB Output is correct
64 Correct 562 ms 10468 KB Output is correct
65 Correct 555 ms 10936 KB Output is correct
66 Correct 136 ms 98352 KB Output is correct
67 Correct 136 ms 98504 KB Output is correct
68 Correct 139 ms 98396 KB Output is correct
69 Correct 135 ms 98408 KB Output is correct
70 Correct 171 ms 98860 KB Output is correct
71 Correct 137 ms 98440 KB Output is correct
72 Correct 136 ms 98464 KB Output is correct
73 Correct 639 ms 12052 KB Output is correct
74 Correct 606 ms 12172 KB Output is correct
75 Correct 678 ms 12736 KB Output is correct
76 Correct 607 ms 12528 KB Output is correct
77 Correct 522 ms 13000 KB Output is correct
78 Correct 318 ms 6744 KB Output is correct
79 Correct 158 ms 98772 KB Output is correct
80 Correct 190 ms 98932 KB Output is correct
81 Correct 154 ms 98800 KB Output is correct
82 Correct 156 ms 98812 KB Output is correct
83 Execution timed out 2084 ms 105596 KB Time limit exceeded
84 Halted 0 ms 0 KB -