oj.uz

답안 #1074502

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1074502 2024-08-25T10:50:36 Z anango 축구 경기장 (IOI23_soccer) C++17
29.5 / 100
 645 ms 79444 KB 
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
vector<vector<int>> pref;
vector<vector<signed>> field;

int INF = 1LL<<30;

int query(int a, int b, int c, int d) {
    if (a<c) swap(a,c);
    if (b<d) swap(b,d);
    return pref[c+1][d+1]-pref[a][d+1]-pref[c+1][b]+pref[a][b];
}

int union_length(vector<int> i1, vector<int> i2) {
    return max(i2[1],i1[1])-min(i2[0],i1[0])+1;
}

int length(vector<int> interval) {
    return interval[1]-interval[0]+1;
}

bool check(vector<int> i1, vector<int> i2) {
    //check whether the length of the union of the intervals is equal to the maximum length of the 2 
    return max(length(i1),length(i2))==union_length(i1,i2);
}

signed biggest_stadium(signed N, vector<vector<signed>> F) {
    //the stadium is valid iff for every pair of cells (a,b) and (c,d), 
    //everything in the paths (a,b) to (a,d) to (c,d) is inside
    //or everything in the paths (a,b) to (a,c) to (c,d) is inside
    n=N;
    field=F;
    pref=vector<vector<int>>(n+1,vector<int>(n+1,0));
    for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            pref[i+1][j+1] = pref[i+1][j]+pref[i][j+1]-pref[i][j]+F[i][j];
        }
    }
    if (pref[n][n]<=1) {
        if (pref[n][n]==0) return n*n;
        //subtask 1
        for (int i=0; i<n; i++) {
            for (int j=0; j<n; j++) {
                if (F[i][j]==1) {
                    int mi = min({(i+1)*(j+1),(n-i)*(j+1),(i+1)*(n-j),(n-i)*(n-j)});
                    return n*n-mi;
                }
            }
        }
    }
    vector<vector<int>> rows(n,{INF,-INF});
    vector<vector<int>> cols(n,{INF,-INF});
    for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            if (F[i][j]==0) {
                rows[i][0] = min(rows[i][0],j);
                rows[i][1] = max(rows[i][1],j);
                cols[j][0] = min(cols[j][0],i);
                cols[j][1] = max(cols[j][1],i);
            }
        }
    }
    for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            if (F[i][j]==1) {
                if (rows[i][0]<=j && j<=rows[i][1]) {
                    return 0;
                }
                if (cols[j][0]<=i && i<=cols[j][1]) {
                    return 0;
                }
            }
        }
    }
    for (int i=0; i<n; i++) {
        for (int j=i+1; j<n; j++) {
            if (!check(rows[i],rows[j])) {
                return 0;
            }
        }
    }
    for (int i=0; i<n; i++) {
        for (int j=i+1; j<n; j++) {
            if (!check(cols[i],cols[j])) {
                return 0;
            }
        }
    }

    return n*n-pref[n][n];
}

Subtask #0
0.0 / 0.0

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

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 1 ms 604 KB ok
8 Correct 13 ms 5204 KB ok
9 Correct 222 ms 78932 KB ok

Subtask #2
2.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Partially correct 1 ms 344 KB partial
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 1 ms 348 KB partial
7 Partially correct 0 ms 372 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 Partially correct 0 ms 600 KB partial
12 Partially correct 0 ms 348 KB partial
13 Correct 0 ms 348 KB ok

Subtask #3
5.5 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 356 KB partial
2 Correct 1 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Partially correct 1 ms 344 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 1 ms 348 KB partial
8 Partially correct 0 ms 372 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 Partially correct 0 ms 600 KB partial
13 Partially correct 0 ms 348 KB partial
14 Correct 0 ms 348 KB ok
15 Partially correct 1 ms 348 KB partial
16 Partially correct 0 ms 348 KB partial
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Correct 0 ms 348 KB ok
21 Correct 0 ms 348 KB ok
22 Partially correct 0 ms 344 KB partial
23 Partially correct 0 ms 348 KB partial
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 1 ms 344 KB partial

Subtask #4
4.5 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 356 KB partial
2 Correct 1 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 1 ms 344 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 1 ms 348 KB partial
10 Partially correct 0 ms 372 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 Partially correct 0 ms 600 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 1 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 0 ms 348 KB partial
21 Partially correct 0 ms 348 KB partial
22 Correct 0 ms 348 KB ok
23 Correct 0 ms 348 KB ok
24 Partially correct 0 ms 344 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 1 ms 344 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 1 ms 344 KB ok
35 Correct 0 ms 348 KB ok
36 Partially correct 0 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 0 ms 348 KB partial
39 Partially correct 1 ms 348 KB partial
40 Partially correct 0 ms 348 KB partial
41 Partially correct 1 ms 348 KB partial

Subtask #5
4.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 356 KB partial
2 Correct 1 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 1 ms 344 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 1 ms 348 KB partial
10 Partially correct 0 ms 372 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 Partially correct 0 ms 600 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 1 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 0 ms 348 KB partial
21 Partially correct 0 ms 348 KB partial
22 Correct 0 ms 348 KB ok
23 Correct 0 ms 348 KB ok
24 Partially correct 0 ms 344 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 1 ms 344 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 1 ms 344 KB ok
35 Correct 0 ms 348 KB ok
36 Partially correct 0 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 0 ms 348 KB partial
39 Partially correct 1 ms 348 KB partial
40 Partially correct 0 ms 348 KB partial
41 Partially correct 1 ms 348 KB partial
42 Partially correct 15 ms 5212 KB partial
43 Partially correct 15 ms 5208 KB partial
44 Partially correct 23 ms 5212 KB partial
45 Partially correct 20 ms 5212 KB partial
46 Partially correct 14 ms 5212 KB partial
47 Partially correct 14 ms 5208 KB partial
48 Correct 39 ms 5212 KB ok
49 Partially correct 15 ms 5212 KB partial
50 Partially correct 18 ms 5276 KB partial
51 Partially correct 14 ms 5212 KB partial
52 Partially correct 22 ms 5212 KB partial
53 Partially correct 25 ms 5208 KB partial
54 Partially correct 16 ms 5212 KB partial
55 Partially correct 14 ms 5208 KB partial
56 Partially correct 14 ms 5212 KB partial
57 Partially correct 14 ms 5212 KB partial
58 Partially correct 15 ms 5208 KB partial
59 Partially correct 15 ms 5208 KB partial

Subtask #6
7.5 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 356 KB partial
2 Correct 1 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 344 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 1 ms 604 KB ok
9 Correct 13 ms 5204 KB ok
10 Correct 222 ms 78932 KB ok
11 Partially correct 1 ms 344 KB partial
12 Partially correct 0 ms 348 KB partial
13 Partially correct 0 ms 348 KB partial
14 Partially correct 1 ms 348 KB partial
15 Partially correct 0 ms 372 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 Partially correct 0 ms 600 KB partial
20 Partially correct 0 ms 348 KB partial
21 Correct 0 ms 348 KB ok
22 Partially correct 1 ms 348 KB partial
23 Partially correct 0 ms 348 KB partial
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial
27 Correct 0 ms 348 KB ok
28 Correct 0 ms 348 KB ok
29 Partially correct 0 ms 344 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 1 ms 344 KB partial
34 Partially correct 0 ms 348 KB partial
35 Partially correct 0 ms 348 KB partial
36 Partially correct 0 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 0 ms 348 KB partial
39 Correct 1 ms 344 KB ok
40 Correct 0 ms 348 KB ok
41 Partially correct 0 ms 348 KB partial
42 Partially correct 0 ms 348 KB partial
43 Partially correct 0 ms 348 KB partial
44 Partially correct 1 ms 348 KB partial
45 Partially correct 0 ms 348 KB partial
46 Partially correct 1 ms 348 KB partial
47 Partially correct 15 ms 5212 KB partial
48 Partially correct 15 ms 5208 KB partial
49 Partially correct 23 ms 5212 KB partial
50 Partially correct 20 ms 5212 KB partial
51 Partially correct 14 ms 5212 KB partial
52 Partially correct 14 ms 5208 KB partial
53 Correct 39 ms 5212 KB ok
54 Partially correct 15 ms 5212 KB partial
55 Partially correct 18 ms 5276 KB partial
56 Partially correct 14 ms 5212 KB partial
57 Partially correct 22 ms 5212 KB partial
58 Partially correct 25 ms 5208 KB partial
59 Partially correct 16 ms 5212 KB partial
60 Partially correct 14 ms 5208 KB partial
61 Partially correct 14 ms 5212 KB partial
62 Partially correct 14 ms 5212 KB partial
63 Partially correct 15 ms 5208 KB partial
64 Partially correct 15 ms 5208 KB partial
65 Partially correct 229 ms 79184 KB partial
66 Partially correct 239 ms 79140 KB partial
67 Partially correct 222 ms 79124 KB partial
68 Partially correct 218 ms 79192 KB partial
69 Partially correct 219 ms 79128 KB partial
70 Partially correct 228 ms 79144 KB partial
71 Partially correct 219 ms 79128 KB partial
72 Partially correct 233 ms 79444 KB partial
73 Correct 645 ms 79188 KB ok
74 Correct 582 ms 79188 KB ok
75 Partially correct 264 ms 79136 KB partial
76 Partially correct 233 ms 79144 KB partial
77 Partially correct 219 ms 79184 KB partial
78 Partially correct 222 ms 79188 KB partial
79 Partially correct 220 ms 79184 KB partial
80 Partially correct 213 ms 79188 KB partial
81 Partially correct 222 ms 79184 KB partial
82 Partially correct 215 ms 79188 KB partial
83 Partially correct 281 ms 79188 KB partial
84 Partially correct 406 ms 79184 KB partial
85 Partially correct 373 ms 79120 KB partial
86 Partially correct 361 ms 79184 KB partial
87 Partially correct 238 ms 79380 KB partial
88 Partially correct 215 ms 79188 KB partial
89 Partially correct 222 ms 79184 KB partial
90 Partially correct 219 ms 79184 KB partial
91 Partially correct 217 ms 79184 KB partial
92 Partially correct 227 ms 79132 KB partial
93 Partially correct 227 ms 79188 KB partial
94 Partially correct 226 ms 79188 KB partial
95 Partially correct 228 ms 79128 KB partial
96 Partially correct 217 ms 79124 KB partial
97 Partially correct 228 ms 79144 KB partial
98 Partially correct 216 ms 79188 KB partial
99 Partially correct 267 ms 79188 KB partial
100 Partially correct 249 ms 79132 KB partial
101 Partially correct 233 ms 79188 KB partial
102 Partially correct 230 ms 79144 KB partial
103 Partially correct 223 ms 79128 KB partial
104 Partially correct 220 ms 79124 KB partial
105 Partially correct 232 ms 79128 KB partial
106 Partially correct 268 ms 79140 KB partial
107 Partially correct 265 ms 79188 KB partial
108 Partially correct 242 ms 79144 KB partial
109 Partially correct 234 ms 79136 KB partial