oj.uz

Submission #722046

# Submission time Handle Problem Language Result Execution time Memory
722046 2023-04-11T10:57:01 Z Sam_a17 Team Contest (JOI22_team) C++17
27 / 100
 2000 ms 107688 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 {

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

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

    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
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Runtime error 3 ms 724 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Runtime error 3 ms 724 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 593 ms 10548 KB Output is correct
12 Correct 366 ms 6968 KB Output is correct
13 Correct 466 ms 8352 KB Output is correct
14 Correct 548 ms 10472 KB Output is correct
15 Correct 550 ms 10900 KB Output is correct
16 Correct 540 ms 11360 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 593 ms 10548 KB Output is correct
12 Correct 366 ms 6968 KB Output is correct
13 Correct 466 ms 8352 KB Output is correct
14 Correct 548 ms 10472 KB Output is correct
15 Correct 550 ms 10900 KB Output is correct
16 Correct 540 ms 11360 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 8 ms 724 KB Output is correct
22 Correct 567 ms 10496 KB Output is correct
23 Correct 545 ms 10452 KB Output is correct
24 Correct 413 ms 7272 KB Output is correct
25 Correct 554 ms 10528 KB Output is correct
26 Correct 545 ms 10848 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 593 ms 10548 KB Output is correct
12 Correct 366 ms 6968 KB Output is correct
13 Correct 466 ms 8352 KB Output is correct
14 Correct 548 ms 10472 KB Output is correct
15 Correct 550 ms 10900 KB Output is correct
16 Correct 540 ms 11360 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 8 ms 724 KB Output is correct
22 Correct 567 ms 10496 KB Output is correct
23 Correct 545 ms 10452 KB Output is correct
24 Correct 413 ms 7272 KB Output is correct
25 Correct 554 ms 10528 KB Output is correct
26 Correct 545 ms 10848 KB Output is correct
27 Correct 2 ms 1492 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 2 ms 1236 KB Output is correct
30 Correct 2 ms 1236 KB Output is correct
31 Correct 18 ms 3300 KB Output is correct
32 Correct 7 ms 2900 KB Output is correct
33 Correct 5 ms 2900 KB Output is correct
34 Correct 691 ms 12052 KB Output is correct
35 Correct 642 ms 13608 KB Output is correct
36 Correct 704 ms 14244 KB Output is correct
37 Correct 631 ms 14328 KB Output is correct
38 Correct 530 ms 14556 KB Output is correct
39 Correct 334 ms 7740 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 593 ms 10548 KB Output is correct
12 Correct 366 ms 6968 KB Output is correct
13 Correct 466 ms 8352 KB Output is correct
14 Correct 548 ms 10472 KB Output is correct
15 Correct 550 ms 10900 KB Output is correct
16 Correct 540 ms 11360 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 8 ms 724 KB Output is correct
22 Correct 567 ms 10496 KB Output is correct
23 Correct 545 ms 10452 KB Output is correct
24 Correct 413 ms 7272 KB Output is correct
25 Correct 554 ms 10528 KB Output is correct
26 Correct 545 ms 10848 KB Output is correct
27 Correct 2 ms 1492 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 2 ms 1236 KB Output is correct
30 Correct 2 ms 1236 KB Output is correct
31 Correct 18 ms 3300 KB Output is correct
32 Correct 7 ms 2900 KB Output is correct
33 Correct 5 ms 2900 KB Output is correct
34 Correct 691 ms 12052 KB Output is correct
35 Correct 642 ms 13608 KB Output is correct
36 Correct 704 ms 14244 KB Output is correct
37 Correct 631 ms 14328 KB Output is correct
38 Correct 530 ms 14556 KB Output is correct
39 Correct 334 ms 7740 KB Output is correct
40 Correct 30 ms 15828 KB Output is correct
41 Correct 40 ms 11620 KB Output is correct
42 Correct 21 ms 11648 KB Output is correct
43 Correct 20 ms 11476 KB Output is correct
44 Execution timed out 2072 ms 107688 KB Time limit exceeded
45 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Runtime error 3 ms 724 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -