Submission #1065933

#	Time	Username	Problem	Language	Result	Execution time	Memory
1065933		deera	축구 경기장 (IOI23_soccer)	C++17	18 / 100	4522 ms	35632 KiB

soccer

#include <bits/stdc++.h>
using namespace std;

struct Pos {
    int x, y;
    Pos(int x, int y) : x(x), y(y) {}
};

bool FIELD[2001][2001] = {0};
bool empty(int a, int b, int x, int y) {
    assert(a == x || b == y); // only 1d queries
    if (a == x)
        for (int i = min(b, y); i <= max(b, y); i++)
            if (FIELD[a][i]) return false;
    if (b == y) 
        for (int i = min(a, x); i <= max(a, x); i++)
            if (FIELD[i][b]) return false;
    return true;
}

int biggest_stadium(int N, vector<vector<int>> F) {
    vector<Pos> trees;
    for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {
        if (F[i][j] == 1) trees.push_back({i, j});
        FIELD[i][j] = F[i][j];
    }

    for (auto tree : trees) {
        cerr << tree.x << " " << tree.y << endl;
    }

    if (trees.size() == 0) return N * N;
    if (trees.size() == 1) {
        int x = trees[0].x, y = trees[0].y;

        int n = N - 1;
        int a = (abs(x - 0) + 1) * (abs(y - 0) + 1);
        int b = (abs(x - 0) + 1) * (abs(y - n) + 1);
        int c = (abs(x - n) + 1) * (abs(y - 0) + 1);
        int d = (abs(x - n) + 1) * (abs(y - n) + 1);


        return N * N - min({a, b, c, d});
    }

    for (int a = 0; a < N; a++) for (int b = 0; b < N; b++) {
        for (int x = 0; x < N; x++) for (int y = 0; y < N; y++) {
            // going throgh (a, y)
            if (a == x && b == y) continue;
            if (FIELD[a][b] || FIELD[x][y]) continue;
            if ((empty(a, b, a, y) && empty(x, y, a, y)) 
              || empty(a, b, x, b) && empty(x, y, x, b)) {
                continue;
            } else {return 0;}
        }
    }

    return N * N - trees.size();
}

Compilation message (stderr)

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:52:36: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   52 |               || empty(a, b, x, b) && empty(x, y, x, b)) {
      |                  ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~

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