Submission #840678

#	Time	Username	Problem	Language	Result	Execution time	Memory
840678		hcng	Soccer Stadium (IOI23_soccer)	C++17	1.50 / 100	258 ms	31776 KiB

soccer

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

using namespace std;

int biggest_stadium(int n, vector<vector<int>> f) {
    int cnt = 0;
    vector<pair<int, int>> v;
    bool flag = false;
    for (int i = 0; i < n; i++) {
        int l = -1, r = -1;
        for (int j = 0; j < n; j++) {
            if (f[i][j] == 0) cnt++;
            if (f[i][j] == 0 && l == -1) {
                l = j;
            }
            if (f[i][j] == 0 && r != -1) {
                return -1;
            }
            if (f[i][j] == 1 && l != -1) {
                r = j - 1;
            }
        }
        if (l != -1 && r == -1) r = n - 1;
        if (!v.empty() && l == -1) {
            if (flag) {
                return -1;
            } else {
                flag = true;
            }
        }
        if (l != -1) v.emplace_back(l, r);
    }
    flag = false;
    for (int i = 1; i < v.size(); i++) {
        if ((v[i].first > v[i - 1].first && v[i].second > v[i - 1].second) || (v[i].first < v[i - 1].first && v[i].second < v[i - 1].second)) {
            return -1;
        }
        if (!flag) {
            if (!(v[i].first <= v[i - 1].first && v[i].second >= v[i - 1].first)) {
                flag = true;
            }
        } else {
            if (!(v[i].first >= v[i - 1].first && v[i].second <= v[i - 1].first)) {
                return -1;
            }
        }
    }
    return cnt;
}

Compilation message (stderr)

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:35:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for (int i = 1; i < v.size(); i++) {
      |                     ~~^~~~~~~~~~

• 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