oj.uz

Submission #721930

# Submission time Handle Problem Language Result Execution time Memory
721930 2023-04-11T08:54:48 Z Sam_a17 Team Contest (JOI22_team) C++17
17 / 100
 2000 ms 9020 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;
int x[N], y[N], z[N];
int n;

void solve_() {
  cin >> n;

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

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

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

  n = sz(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;

    //
    xs.emplace_back(x[i], i);
    ys.emplace_back(y[i], i);
    zs.emplace_back(z[i], i);
  }

  sort(rall(xs));
  sort(rall(ys));
  sort(rall(zs));

  int answ = -1;
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < n; j++) {
      for(int k = 0; k < n; k++) {
        int xx = xs[i].second, yy = ys[j].second, zz = zs[k].second;
        if(x[xx] <= x[yy] || x[xx] <= x[zz]) {
          continue;
        }
        
        if(y[yy] <= y[xx] || y[yy] <= y[zz]) {
          continue;
        }

        if(z[zz] <= z[yy] || z[zz] <= z[xx]) {
          continue;
        }

        answ = max(answ, x[xx] + y[yy] + z[zz]);
      }
    }
  }

  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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 47 ms 372 KB Output is correct
15 Correct 20 ms 340 KB Output is correct
16 Correct 30 ms 340 KB Output is correct
17 Correct 36 ms 340 KB Output is correct
18 Correct 36 ms 340 KB Output is correct
19 Correct 44 ms 340 KB Output is correct
20 Correct 20 ms 376 KB Output is correct
21 Correct 13 ms 380 KB Output is correct
22 Correct 26 ms 376 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 31 ms 340 KB Output is correct
25 Correct 31 ms 340 KB Output is correct

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 47 ms 372 KB Output is correct
15 Correct 20 ms 340 KB Output is correct
16 Correct 30 ms 340 KB Output is correct
17 Correct 36 ms 340 KB Output is correct
18 Correct 36 ms 340 KB Output is correct
19 Correct 44 ms 340 KB Output is correct
20 Correct 20 ms 376 KB Output is correct
21 Correct 13 ms 380 KB Output is correct
22 Correct 26 ms 376 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 31 ms 340 KB Output is correct
25 Correct 31 ms 340 KB Output is correct
26 Execution timed out 2084 ms 724 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 45 ms 8076 KB Output is correct
12 Correct 27 ms 4296 KB Output is correct
13 Correct 30 ms 5412 KB Output is correct
14 Correct 37 ms 9020 KB Output is correct
15 Correct 33 ms 9000 KB Output is correct
16 Correct 32 ms 9012 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 45 ms 8076 KB Output is correct
12 Correct 27 ms 4296 KB Output is correct
13 Correct 30 ms 5412 KB Output is correct
14 Correct 37 ms 9020 KB Output is correct
15 Correct 33 ms 9000 KB Output is correct
16 Correct 32 ms 9012 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 26 ms 340 KB Output is correct
21 Execution timed out 2069 ms 472 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 45 ms 8076 KB Output is correct
12 Correct 27 ms 4296 KB Output is correct
13 Correct 30 ms 5412 KB Output is correct
14 Correct 37 ms 9020 KB Output is correct
15 Correct 33 ms 9000 KB Output is correct
16 Correct 32 ms 9012 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 26 ms 340 KB Output is correct
21 Execution timed out 2069 ms 472 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 45 ms 8076 KB Output is correct
12 Correct 27 ms 4296 KB Output is correct
13 Correct 30 ms 5412 KB Output is correct
14 Correct 37 ms 9020 KB Output is correct
15 Correct 33 ms 9000 KB Output is correct
16 Correct 32 ms 9012 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 26 ms 340 KB Output is correct
21 Execution timed out 2069 ms 472 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 47 ms 372 KB Output is correct
15 Correct 20 ms 340 KB Output is correct
16 Correct 30 ms 340 KB Output is correct
17 Correct 36 ms 340 KB Output is correct
18 Correct 36 ms 340 KB Output is correct
19 Correct 44 ms 340 KB Output is correct
20 Correct 20 ms 376 KB Output is correct
21 Correct 13 ms 380 KB Output is correct
22 Correct 26 ms 376 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 31 ms 340 KB Output is correct
25 Correct 31 ms 340 KB Output is correct
26 Execution timed out 2084 ms 724 KB Time limit exceeded
27 Halted 0 ms 0 KB -