oj.uz

답안 #1078486

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078486 2024-08-27T18:19:40 Z hasan2006 축구 경기장 (IOI23_soccer) C++17
0 / 100
 2 ms 1228 KB 
#include "soccer.h"
#include <bits/stdc++.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 = 30 + 9 , mod = 1e9 + 7;
int dp[N][N][N] , c[N][N] ,  d[N][N][N] ;

int sum(int x , int y ,  int x1 , int y1) {
    return (c[x1][y1] + c[x - 1][y - 1] - c[x1][y - 1] - c[x - 1][y1]);
}
int biggest_stadium(int n, std::vector<std::vector<int>> a) {
    int i , j , l , r , s = 0 , f , m , x , y , k;
    for(i = 1; i <= n; i++)
        for(j = 1; j <= n; j++)
            c[i][j] = a[j - 1][i - 1] + c[i][j - 1] +  c[i - 1][j] - c[i - 1][j - 1];
    for(i = 1; i <= n; i++) {
        for(y = 0; y < n; y++) {
            for(j = 1; j + y <= n; j++) {
                x = y + j;
                dp[i][j][x] = max(dp[i][j + 1][x] , dp[i][j][x - 1]);
                if(sum(i , j, i , x) == 0) {
                    dp[i][j][x] = max(dp[i][j][x] , x - j + 1 + dp[i - 1][j][x]);
                }
            }
        }
    }
    for(i = n; i >= 1; i--) {
        for(y = 0; y < n; y++) {
            for(j = 1; j + y <= n; j++) {
                x = y + j;
                d[i][j][x] = max(d[i][j + 1][x] , d[i][j][x - 1]);
                if(sum(i , j, i , x) == 0) {
                    d[i][j][x] = max(d[i][j][x] , x - j + 1 + d[i + 1][j][x]);
                }
            }
        }
    }
    for(i = 1; i <= n; i++) {
        for(j = 1; j <= n; j++) {
            for(x = j;  x <= n; x++) {
                s = max(s , dp[i][j][x] + d[i + 1][j][x]);
                s = max(s , d[i][j][x] + dp[i - 1][j][x]);
            }
        }
    }
    return s;
}

Compilation message

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

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok

Subtask #1
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 1 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 Runtime error 2 ms 1228 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 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 Incorrect 1 ms 348 KB wrong
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# 결과 실행 시간 메모리 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 Incorrect 1 ms 348 KB wrong
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# 결과 실행 시간 메모리 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 1 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 Incorrect 1 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 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 1 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 Incorrect 1 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# 결과 실행 시간 메모리 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 1 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 Runtime error 2 ms 1228 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -