Submission #1075716

#	Time	Username	Problem	Language	Result	Execution time	Memory
1075716		c2zi6	Soccer Stadium (IOI23_soccer)	C++17	6 / 100	256 ms	39568 KiB

soccer

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "soccer.h"

int biggest_stadium(int n, VVI a) {
    int x, y;
    x = -1, y = -1;
    rep(i, n) rep(j, n) if (a[i][j] == 1) x = i, y = j;
    if (x == -1) return n*n;
    int ans = 0;
    setmax(ans, n*n - (x+1)*(y+1));
    setmax(ans, n*n - (x+1)*(n-y));
    setmax(ans, n*n - (n-x)*(y+1));
    setmax(ans, n*n - (n-x)*(n-y));
    return ans;
}

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