oj.uz

답안 #1023571

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1023571 2024-07-15T02:46:57 Z LIF 축구 경기장 (IOI23_soccer) C++17
6 / 100
 276 ms 57236 KB 
#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

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 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 2392 KB partial

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB ok
2 Correct 1 ms 2396 KB ok
3 Correct 1 ms 2492 KB ok
4 Correct 1 ms 2396 KB ok
5 Correct 1 ms 2396 KB ok
6 Correct 1 ms 2500 KB ok
7 Correct 2 ms 4444 KB ok
8 Correct 15 ms 9052 KB ok
9 Correct 276 ms 57236 KB ok

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB ok
2 Correct 1 ms 2396 KB ok
3 Partially correct 0 ms 2396 KB partial
4 Partially correct 0 ms 2396 KB partial
5 Partially correct 0 ms 2396 KB partial
6 Partially correct 1 ms 2396 KB partial
7 Partially correct 0 ms 2396 KB partial
8 Correct 0 ms 2396 KB ok
9 Correct 0 ms 2396 KB ok
10 Incorrect 0 ms 2396 KB wrong
11 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 2392 KB partial
2 Correct 1 ms 2392 KB ok
3 Correct 1 ms 2396 KB ok
4 Partially correct 0 ms 2396 KB partial
5 Partially correct 0 ms 2396 KB partial
6 Partially correct 0 ms 2396 KB partial
7 Partially correct 1 ms 2396 KB partial
8 Partially correct 0 ms 2396 KB partial
9 Correct 0 ms 2396 KB ok
10 Correct 0 ms 2396 KB ok
11 Incorrect 0 ms 2396 KB wrong
12 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 2392 KB partial
2 Correct 1 ms 2392 KB ok
3 Correct 1 ms 2396 KB ok
4 Correct 1 ms 2492 KB ok
5 Correct 1 ms 2396 KB ok
6 Partially correct 0 ms 2396 KB partial
7 Partially correct 0 ms 2396 KB partial
8 Partially correct 0 ms 2396 KB partial
9 Partially correct 1 ms 2396 KB partial
10 Partially correct 0 ms 2396 KB partial
11 Correct 0 ms 2396 KB ok
12 Correct 0 ms 2396 KB ok
13 Incorrect 0 ms 2396 KB wrong
14 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 2392 KB partial
2 Correct 1 ms 2392 KB ok
3 Correct 1 ms 2396 KB ok
4 Correct 1 ms 2492 KB ok
5 Correct 1 ms 2396 KB ok
6 Partially correct 0 ms 2396 KB partial
7 Partially correct 0 ms 2396 KB partial
8 Partially correct 0 ms 2396 KB partial
9 Partially correct 1 ms 2396 KB partial
10 Partially correct 0 ms 2396 KB partial
11 Correct 0 ms 2396 KB ok
12 Correct 0 ms 2396 KB ok
13 Incorrect 0 ms 2396 KB wrong
14 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 2392 KB partial
2 Correct 1 ms 2392 KB ok
3 Correct 1 ms 2396 KB ok
4 Correct 1 ms 2492 KB ok
5 Correct 1 ms 2396 KB ok
6 Correct 1 ms 2396 KB ok
7 Correct 1 ms 2500 KB ok
8 Correct 2 ms 4444 KB ok
9 Correct 15 ms 9052 KB ok
10 Correct 276 ms 57236 KB ok
11 Partially correct 0 ms 2396 KB partial
12 Partially correct 0 ms 2396 KB partial
13 Partially correct 0 ms 2396 KB partial
14 Partially correct 1 ms 2396 KB partial
15 Partially correct 0 ms 2396 KB partial
16 Correct 0 ms 2396 KB ok
17 Correct 0 ms 2396 KB ok
18 Incorrect 0 ms 2396 KB wrong
19 Halted 0 ms 0 KB -