Submission #1023571

#	Time	Username	Problem	Language	Result	Execution time	Memory
1023571		LIF	Soccer Stadium (IOI23_soccer)	C++17	6 / 100	276 ms	57236 KiB

soccer

#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
int FF[2005][2005];
int FF2[2005][2005];
int FF3[2005][2005];
int FF4[2005][2005];
int biggest_stadium(int N, vector<vector<int>> F)
{
    for(int i=0;i<F.size();i++)
    {
        for(int j=0;j<F[i].size();j++)FF[i+1][j+1] = F[i][j];
    }
    bool exis = false;
    int ii = -1;
    int jj = -1;
    for(int i=1;i<=N;i++)
    {
        for(int j=1;j<=N;j++)
        {
            if(FF[i][j] == 1)
            {
                exis = true;
                ii = i;
                jj = j;
            }
        }
    }
    
    if(exis == false)return N*N;
    int ans1 = 0;
    int ans2 = 0;
    int ans3 = 0;
    int ans4 = 0;
    for(int i=1;i<=N;i++)
    {
        for(int j=1;j<=N;j++)
        {
            if((j > jj) || (i > ii))ans1++;
        }
    }
    for(int i=1;i<=N;i++)
    {
        for(int j=1;j<=N;j++)
        {
            if((j < jj) || (i < ii))ans2++;
        }
    }
    for(int i=1;i<=N;i++)
    {
        for(int j=1;j<=N;j++)
        {
            if((j > jj) || (i < ii))ans3++;
        }
    }
    for(int i=1;i<=N;i++)
    {
        for(int j=1;j<=N;j++)
        {
            if((j < jj) || (i > ii))ans4++;
        }
    }
    return max(max(ans1,ans2),max(ans3,ans4));
}

Compilation message (stderr)

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:10:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for(int i=0;i<F.size();i++)
      |                 ~^~~~~~~~~
soccer.cpp:12:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |         for(int j=0;j<F[i].size();j++)FF[i+1][j+1] = F[i][j];
      |                     ~^~~~~~~~~~~~

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