Submission #1018227

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018227		tmarcinkevicius	Soccer Stadium (IOI23_soccer)	C++17	2 / 100	4568 ms	258840 KiB

soccer

#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
#define f first
#define s second

int biggest_stadium(int N, vector<vector<int>> F)
{
    vector<vector<int>> prefixLine(N), prefixCol(N);

    for (int i = 0; i < N; i++)
    {
        prefixLine[i] = vector<int>(N, 0);

        prefixLine[i][0] = F[i][0];

        for (int j = 1; j < N; j++)
        {
            prefixLine[i][j] = prefixLine[i][j - 1] + F[i][j];
        }
    }

    for (int i = 0; i < N; i++)
    {
        prefixCol[i] = vector<int>(N, 0);

        prefixCol[i][0] = F[0][i];

        for (int j = 1; j < N; j++)
        {
            prefixCol[i][j] = prefixCol[i][j - 1] + F[j][i];
        }
    }

    set<pii> freeCells;
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            if (F[i][j] == 0)
            {
                freeCells.insert({i, j});
            }
        }
    }

    bool possible = true;
    for (pii p1 : freeCells)
    {
        for (pii p2 : freeCells)
        {
            if (p1 == p2)
                continue;

            if (p1.f == p2.f)
            {
                int sum = prefixLine[p1.f][max(p1.s, p2.s)] - prefixLine[p1.f][min(p1.s, p2.s)];
                if (sum != 0)
                {
                    possible = false;
                    break;
                }
            }
            else if (p1.s == p2.s)
            {
                int sum = prefixCol[p1.s][max(p1.f, p2.f)] - prefixCol[p1.s][min(p1.f, p2.f)];
                if (sum != 0)
                {
                    possible = false;
                    break;
                }
            }
            else
            {
                int sum1 = prefixLine[p1.f][max(p1.s, p2.s)] - prefixLine[p1.f][min(p1.s, p2.s)] +
                            prefixCol[p2.s][max(p1.f, p2.f)] - prefixCol[p2.s][min(p1.f, p2.f)];

                int sum2 = prefixLine[p2.f][max(p1.s, p2.s)] - prefixLine[p2.f][min(p1.s, p2.s)] +
                            prefixCol[p1.s][max(p1.f, p2.f)] - prefixCol[p1.s][min(p1.f, p2.f)];

                if (sum1 != 0 && sum2 != 0)
                {
                    possible = false;
                    break;
                }
            }
        }

        if (!possible)
            break;
    }

    if (possible)
    {
        return freeCells.size();
    }
    else
    {
        return 0;
    }
}

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