oj.uz

Submission #973406

# Submission time Handle Problem Language Result Execution time Memory
973406 2024-05-02T00:39:28 Z irmuun Soccer Stadium (IOI23_soccer) C++17
6 / 100
 227 ms 31784 KB 
#include<bits/stdc++.h>
#include "soccer.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int biggest_stadium(int n,vector<vector<int>>f){
    int total=0,x,y;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(f[i][j]==1){
                total++;
                x=i;
                y=j;
            }
        }
    }
    if(total<=1){
        if(total==0){
            return n*n;
        }
        else{
            if(x==0||y==0||x==n-1||y==n-1){
                return n*n-1;
            }
            x++;
            y++;
            x=min(x,n+1-x);
            y=min(y,n+1-y);
            return n*n-x*y;
        }
    }
    bool can=true;
    vector<pair<int,int>>v,u;
    for(int i=0;i<n;i++){
        int l=-1,r=-1;
        for(int j=0;j<n;j++){
            if(f[i][j]==0){
                if(l==-1) l=j;
                r=j;
            }
        }
        for(int j=l;j<=r;j++){
            if(f[i][j]==1){
                can=false;
            }
        }
        if(l!=-1) v.pb({l,r});
    }
    for(int j=0;j<n;j++){
        int l=-1,r=-1;
        for(int i=0;i<n;i++){
            if(f[i][j]==0){
                if(l==-1) l=i;
                r=i;
            }
        }
        for(int i=l;i<=r;i++){
            if(f[i][j]==1){
                can=false;
            }
        }
        if(l!=-1) u.pb({l,r});
    }
    for(auto [l1,r1]:v){
        for(auto [l2,r2]:v){
            if(l1<=l2&&r2<=r1) continue;
            if(l2<=l1&&r1<=r2) continue;
            can=false;
        }
    }
    if(can){
        return n*n-total;
    }
    return 0;
}

Compilation message

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:29:34: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
   29 |             if(x==0||y==0||x==n-1||y==n-1){
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~
soccer.cpp:29:26: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   29 |             if(x==0||y==0||x==n-1||y==n-1){
      |                ~~~~~~~~~~^~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB partial

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory 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 Correct 0 ms 348 KB ok
7 Correct 1 ms 348 KB ok
8 Correct 15 ms 2200 KB ok
9 Correct 227 ms 31784 KB ok

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Partially correct 0 ms 348 KB partial
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Correct 0 ms 348 KB ok
9 Correct 0 ms 348 KB ok
10 Partially correct 0 ms 348 KB partial
11 Runtime error 0 ms 348 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Correct 0 ms 348 KB ok
10 Correct 0 ms 348 KB ok
11 Partially correct 0 ms 348 KB partial
12 Runtime error 0 ms 348 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 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 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Partially correct 0 ms 348 KB partial
14 Runtime error 0 ms 348 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 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 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Partially correct 0 ms 348 KB partial
14 Runtime error 0 ms 348 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 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 Correct 0 ms 348 KB ok
8 Correct 1 ms 348 KB ok
9 Correct 15 ms 2200 KB ok
10 Correct 227 ms 31784 KB ok
11 Partially correct 0 ms 348 KB partial
12 Partially correct 0 ms 348 KB partial
13 Partially correct 0 ms 348 KB partial
14 Partially correct 0 ms 348 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Correct 0 ms 348 KB ok
18 Partially correct 0 ms 348 KB partial
19 Runtime error 0 ms 348 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -