oj.uz

답안 #1059130

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1059130 2024-08-14T17:39:14 Z hasan2006 축구 경기장 (IOI23_soccer) C++17
1.5 / 100
 163 ms 39712 KB 
#include <bits/stdc++.h>
#include "soccer.h"
using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 5e5 + 9 , mod = 1e9 + 7;
ll a[N] , b[N] , dp[N] , c[N] , d[N];


int biggest_stadium(int n , vector<vector<int>>a) {
    ll i , j ,  l,  r , s  = 0 , f  = 0 , x , y , k , m ;
    for(i = 0; i < n; i++) {
        s = 0;
        for(j = 0; j < n; j++) {
            f += 1 - a[i][j];
            if(a[i][j] == 0 && s == 0)
                s = 1;
            else if(a[i][j] == 1 && s == 1)
                s = 2;
            else if(a[i][j] == 0 && s == 2)
                s = -1;
        }
        if(s == -1)
            return n * n + 1;
    }
    for(i = 0; i < n; i++) {
        s = 0;
        for(j = 0; j < n; j++) {
            if(a[j][i] == 0 && s == 0)
                s = 1;
            else if(a[j][i] == 1 && s == 1)
                s = 2;
            else if(a[j][i] == 0 && s == 2)
                s = -1;
        }
        if(s == -1)
            return n * n + 1;
    }
    return f;
}

Compilation message

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:26:17: warning: unused variable 'l' [-Wunused-variable]
   26 |     ll i , j ,  l,  r , s  = 0 , f  = 0 , x , y , k , m ;
      |                 ^
soccer.cpp:26:21: warning: unused variable 'r' [-Wunused-variable]
   26 |     ll i , j ,  l,  r , s  = 0 , f  = 0 , x , y , k , m ;
      |                     ^
soccer.cpp:26:43: warning: unused variable 'x' [-Wunused-variable]
   26 |     ll i , j ,  l,  r , s  = 0 , f  = 0 , x , y , k , m ;
      |                                           ^
soccer.cpp:26:47: warning: unused variable 'y' [-Wunused-variable]
   26 |     ll i , j ,  l,  r , s  = 0 , f  = 0 , x , y , k , m ;
      |                                               ^
soccer.cpp:26:51: warning: unused variable 'k' [-Wunused-variable]
   26 |     ll i , j ,  l,  r , s  = 0 , f  = 0 , x , y , k , m ;
      |                                                   ^
soccer.cpp:26:55: warning: unused variable 'm' [-Wunused-variable]
   26 |     ll i , j ,  l,  r , s  = 0 , f  = 0 , x , y , k , m ;
      |                                                       ^

Subtask #0
0.0 / 0.0

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

Subtask #1
1.5 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 444 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 1 ms 348 KB partial
8 Partially correct 10 ms 2832 KB partial
9 Partially correct 163 ms 39712 KB partial

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 344 KB ok
3 Partially correct 0 ms 344 KB partial
4 Partially correct 0 ms 348 KB partial
5 Incorrect 0 ms 348 KB wrong
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 344 KB ok
4 Partially correct 0 ms 344 KB partial
5 Partially correct 0 ms 348 KB partial
6 Incorrect 0 ms 348 KB wrong
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

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

Subtask #5
0.0 / 16.0

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

Subtask #6
0.0 / 30.0

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