답안 #858270

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
858270	2023-10-07T21:14:34 Z	Danilo21	축구 경기장 (IOI23_soccer)	C++17	1.5 / 100	243 ms	48408 KB

soccer

#include <bits/stdc++.h>
#include "soccer.h"

#define ll long long
#define ld long double
#define pb push_back
#define fi first
#define se second
#define en '\n'
#define sp ' '
#define tb '\t'
#define ri(n) int n; cin >> n
#define rl(n) ll n; cin >> n
#define rs(s) string s; cin >> s
#define rc(c) char c; cin >> c
#define rv(v) for (auto &x : v) cin >> x
#define pven(v) for (auto x : v) cout << x << en
#define pv(v) for (auto x : v) cout << x << sp; cout << en
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define yes cout << "YES" << en
#define no cout << "NO" << en
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
#define ssort(a, b) if (a < b) swap(a, b)
#define bitcnt(a) (__builtin_popcountll(a))
#define bithigh(a) (63-__builtin_clzll(a))
#define lg bithigh
#define highpow(a) (1LL << (ll)lg(a))

using namespace std;

const ll LINF = 2e18;
const int mxN = 300, INF = 2e9;

bool Check(int N, vector<vector<int> > F){

    for (int i = 0; i < N; i++){
        bool f = 0;
        for (int j = 0; j < N; j++){
            if (!F[i][j]){
                if (f) return 0;
                while (j+1 < N && !F[i][j+1])
                    j++;
                f = 1;
            }
        }
    }
    return 1;
}

int biggest_stadium(int N, vector<vector<int>> F){

    if (!Check(N, F)) return 0;
    vector<vector<int> > G(N, vector<int>(N));
    int cnt = 0;
    for (int i = 0; i < N; i++){
        for (int j = 0; j < N; j++){
            G[i][j] = F[j][i];
            cnt += F[j][i];
        }
    }
    if (!Check(N, G)) return 0;
    return N*N - cnt;
}

Subtask #0

0.0 / 0.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	348 KB	partial

Subtask #1

1.5 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	ok
2	Correct	0 ms	348 KB	ok
3	Correct	0 ms	348 KB	ok
4	Correct	0 ms	348 KB	ok
5	Correct	0 ms	348 KB	ok
6	Partially correct	0 ms	348 KB	partial
7	Partially correct	1 ms	348 KB	partial
8	Partially correct	15 ms	3420 KB	partial
9	Partially correct	243 ms	48408 KB	partial

Subtask #2

0.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	ok
2	Correct	0 ms	348 KB	ok
3	Partially correct	0 ms	344 KB	partial
4	Partially correct	0 ms	348 KB	partial
5	Incorrect	0 ms	348 KB	wrong
6	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	348 KB	partial
2	Correct	0 ms	348 KB	ok
3	Correct	0 ms	348 KB	ok
4	Partially correct	0 ms	344 KB	partial
5	Partially correct	0 ms	348 KB	partial
6	Incorrect	0 ms	348 KB	wrong
7	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	348 KB	partial
2	Correct	0 ms	348 KB	ok
3	Correct	0 ms	348 KB	ok
4	Correct	0 ms	348 KB	ok
5	Correct	0 ms	348 KB	ok
6	Partially correct	0 ms	344 KB	partial
7	Partially correct	0 ms	348 KB	partial
8	Incorrect	0 ms	348 KB	wrong
9	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	348 KB	partial
2	Correct	0 ms	348 KB	ok
3	Correct	0 ms	348 KB	ok
4	Correct	0 ms	348 KB	ok
5	Correct	0 ms	348 KB	ok
6	Partially correct	0 ms	344 KB	partial
7	Partially correct	0 ms	348 KB	partial
8	Incorrect	0 ms	348 KB	wrong
9	Halted	0 ms	0 KB	-

Subtask #6

0.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	348 KB	partial
2	Correct	0 ms	348 KB	ok
3	Correct	0 ms	348 KB	ok
4	Correct	0 ms	348 KB	ok
5	Correct	0 ms	348 KB	ok
6	Correct	0 ms	348 KB	ok
7	Partially correct	0 ms	348 KB	partial
8	Partially correct	1 ms	348 KB	partial
9	Partially correct	15 ms	3420 KB	partial
10	Partially correct	243 ms	48408 KB	partial
11	Partially correct	0 ms	344 KB	partial
12	Partially correct	0 ms	348 KB	partial
13	Incorrect	0 ms	348 KB	wrong
14	Halted	0 ms	0 KB	-