Submission #936865

#	Time	Username	Problem	Language	Result	Execution time	Memory
936865		xynex	Soccer Stadium (IOI23_soccer)	C++17	0 / 100	0 ms	348 KiB

soccer

/**
  * Author: Tenjin
  * Created: 27.04.2022 18:58
  * Why am I so stupid? :c
  * Slishkom slab
**/

#include <bits/stdc++.h>

 #pragma GCC optimize("inline")
 #pragma GCC optimize("-fgcse,-fgcse-lm")
 #pragma GCC optimize("-ftree-pre,-ftree-vrp")
 #pragma GCC optimize("-ffast-math")
 #pragma GCC optimize("-fipa-sra")
 #pragma GCC optimize("-fpeephole2")
 #pragma GCC optimize("-fsched-spec")
 #pragma GCC optimize("Ofast,no-stack-protector")
 #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A>  void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const ll INF = 1e14;
const int M = 2e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/

const int N = 1e3 + 5;
/*
5
0 0 0 0 0
1 0 0 0 0
0 0 0 0 1
0 0 0 0 0
0 0 1 0 0
*/
int biggest_stadium(int n, vt<vt<int>> a) {
  vt<int> height(n + 1, -1);
  vt<vt<int>> countH(n + 1);
  vt<int> dp(n + 1), left(n + 1), right(n + 1);
  int ans = 0;
  for(int i = 0; i < n; ++i) {
    for(int j = 0; j < n; ++j) {
      if(a[i][j]) height[j] = -1, dp[j] = 0;
      else countH[++height[j]].pb(j);
    }
    vt<int> st;
    for(int j = 0; j < n; ++j) {
      while(!st.empty() && height[st.back()] >= height[i]) st.pop_back();
      if(st.empty()) left[j] = -1;
      else left[j] = st.back();
      st.push_back(j);
    }
    st.clear();
    for(int j = n - 1; j >= 0; --j) {
      while(!st.empty() && height[st.back()] >= height[i]) st.pop_back();
      if(st.empty()) right[j] = n;
      else right[j] = st.back();
      st.push_back(j);
    }
    /*print(i);
    for(int j = 0; j < n; ++j) print(left[j], right[j]);*/
    for(int h = 0; h < n; ++h) {
      //print(h);
     // print(countH[h]);
      for(auto cur : countH[h]) {
        int len = right[cur] - left[cur] - 1;
        dp[cur] += len;
        if(left[cur] >= 0) dp[cur] = max(dp[cur], dp[left[cur]] + len * (h - height[left[cur]]));
        if(right[cur] < n) dp[cur] = max(dp[cur], dp[right[cur]] + len * (h - height[right[cur]]));
        //write(dp[cur], ' ');
        ans = max(ans, dp[cur]);
      }
      countH[h].clear();
      //print("");
    }
  }
  return ans;
}

Compilation message (stderr)

soccer.cpp: In function 'void freop(std::string)':
soccer.cpp:72:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
soccer.cpp:73:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 22
• Subtask 4: 0 / 18
• Subtask 5: 0 / 16
• Subtask 6: 0 / 30