제출 #839783

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
839783		model_code	Soccer Stadium (IOI23_soccer)	C++17	6 / 100	245 ms	35588 KiB

soccer

// incorrect/sol_db_atmost_one.cpp

#include "soccer.h"
#include <iostream>
#include <array>
#include <map>
#include <algorithm>
#include <cassert>
#define xx first
#define yy second

using namespace std;
typedef pair<int, int> pii;

int biggest_stadium(int N, vector<vector<int>> C)
{
    int x = 1, y = 1;
    for (int i = 0; i < N; ++i)
    {
        for (int j = 0; j < N; ++j)
        {
            if (C[i][j])
                x = i, y = j;
        }
    }
    int ans = 0;
    ans = max(ans, N * N - (x + 1) * (y + 1));
    ans = max(ans, N * N - (N - x) * (y + 1));
    ans = max(ans, N * N - (x + 1) * (N - y));
    ans = max(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