Submission #980164

#	Time	Username	Problem	Language	Result	Execution time	Memory
980164		vjudge1	Soccer Stadium (IOI23_soccer)	C++17	0 / 100	1 ms	600 KiB

soccer

#include <algorithm>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#include <iostream>
#include <cmath>
#include <queue>
#include <set>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define F first
#define S second
#define PB push_back
using namespace std;
const long long MOD=1e9+7, INF=1e18;
const int INFI=1e9;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<pair<int, ii>> viii;
typedef vector<vii> vvii;
typedef vector<ll> vll;
typedef vector<vll> vvll;

int biggest_stadium(int n, vvi f){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int cnt=0, x, y;
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            if(f[i][j]==1){
                cnt++;
                y=i;    x=j;
            }
    if(cnt>1)   return 0;
    int ans=1;
    int aux=n*(n-1-y)+max((y+1)*x, (y+1)*(n-x-1));
    ans=max(ans, aux);
    aux=n*y+max((n-x-1)*(n-y), x*(n-y));
    ans=max(ans, aux);
    
    aux=n*x+max((n-x)*y, (n-x)*(n-y-1));
    ans=max(ans, aux);
    aux=n*(n-x-1)+max((x+1)*y, (x+1)*(n-y-1));
    ans=max(ans, aux);
    return ans;
}

Compilation message (stderr)

soccer.cpp: In function 'int biggest_stadium(int, vvi)':
soccer.cpp:48:10: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   48 |     aux=n*x+max((n-x)*y, (n-x)*(n-y-1));
      |         ~^~
soccer.cpp:45:10: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
   45 |     aux=n*y+max((n-x-1)*(n-y), x*(n-y));
      |         ~^~

• 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