Submission #839792

#	Time	Username	Problem	Language	Result	Execution time	Memory
839792		model_code	Soccer Stadium (IOI23_soccer)	C++17	1.50 / 100	264 ms	51196 KiB

soccer

// partially_correct/sol_db_check_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)
{
    vector<int> emptyvec(N, 0);
    vector<vector<int>> emptymat(N, emptyvec);
    if (C == emptymat)
    {
        return N * N;
    }
    return C[0][0] || C[0].back() || C.back()[0] || C.back().back() ? N * N - 1 : 0;
}

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