oj.uz

답안 #1042857

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1042857 2024-08-03T13:12:18 Z ZanP 축구 경기장 (IOI23_soccer) C++17
29.5 / 100
 1280 ms 797216 KB 
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;

struct point{
    int i, j;
    point(){}
    point(int i, int j){
        this->i = i; this->j = j;
    }
};
struct rect{
    point ul, dr;
    rect(){}
    rect(point ul, point dr){this->ul = ul, this->dr = dr;}
};
bool operator==(const point & a, const point & b){return a.i == b.i && a.j == b.j;}
bool operator==(const rect & a, const rect & b){return a.ul == b.ul && a.dr == b.dr;}
bool operator<(const rect & a, const rect & b){
    int h_a = a.dr.i - a.ul.i + 1, h_b = b.dr.i - b.ul.i + 1;
    if(h_a == h_b){
        return a.ul.j < b.ul.j;
    }
    return h_a < h_b;
}

ostream& operator<<(ostream& os, vector<int> & a){
    os << "{ ";
    for(int i = 0; i<a.size(); i++){os << a[i] << ", ";}
    os << "}\n";
    return os;
}
ostream& operator<<(ostream& os, vector<vector<int>> & a){
    os << "{ ";
    for(int i = 0; i<a.size(); i++){os << a[i] << ", ";}
    os << "}\n";
    return os;
}
ostream& operator<<(ostream& os, point & a){
    os << "(" << a.i << "," << a.j << ")";
    return os;
}

ostream& operator<<(ostream& os, rect & a){
    os << "{" << a.ul << "," << a.dr << "}\n";
    return os;
}
ostream& operator<<(ostream& os, vector<rect> & a){
    os << "{ ";
    for(int i = 0; i<a.size(); i++){os << a[i] << ", ";}
    os << "}\n";
    return os;
}


vector<vector<int>> look_up, look_down, look_right, look_left;
vector<int> lg;
vector<vector<vector<int>>> rmq_up, rmq_down;

int get_rmq_up(int i, int l, int r){
    int k = lg[r - l + 1];
    return min(rmq_up[i][l][k], rmq_up[i][r - (1 << k) + 1][k]);
}

int get_rmq_down(int i, int l, int r){
    int k = lg[r - l + 1];
    return min(rmq_down[i][l][k], rmq_down[i][r - (1 << k) + 1][k]);
}

int biggest_stadium(int n, vector<vector<int>> grid)
{
    look_up.resize(n,vector<int>(n));
    look_down.resize(n,vector<int>(n));
    look_right.resize(n,vector<int>(n));
    look_left.resize(n,vector<int>(n));
    for(int j = 0;j<n;j++){
        look_up[0][j] = 1 - grid[0][j];
        look_down[n-1][j] = 1 - grid[n-1][j];
        look_left[j][0] = 1 - grid[j][0];
        look_right[j][n-1] = 1 - grid[j][n-1];
    }

    for(int i = 1; i < n; i++){
        for(int j = 0;j < n; j++){
            look_up[i][j] = (grid[i][j]) ? 0 : 1 + look_up[i-1][j];
            look_down[n-i-1][j] = (grid[n-i-1][j]) ? 0 : 1 + look_down[n-i][j];
            look_left[j][i] = (grid[j][i]) ? 0 : 1 + look_left[j][i-1];
            look_right[j][n-i-1] = (grid[j][n-i-1]) ? 0 : 1 + look_right[j][n-i];
        }
    }

    lg.resize(n+1,0);
    for(int i = 2; i<=n;i++){lg[i] = 1 + lg[i>>1];}

    //cout << look_up << '\n' << look_down << '\n' << look_right << '\n' << look_left << '\n';

    rmq_up.resize(n,vector<vector<int>>(n,vector<int>(lg[n]+1)));
    rmq_down.resize(n,vector<vector<int>>(n,vector<int>(lg[n]+1)));
    for(int i = 0;i<n;i++)for(int j = 0;j<n;j++){
        rmq_up[i][j][0] = look_up[i][j];
        rmq_down[i][j][0] = look_down[i][j];
    }

    for(int k = 1; k <= lg[n]; k++){
        for(int i = 0; i < n; i++){
            for(int j = 0; j + (1 << (k-1)) < n; j++){
                rmq_up[i][j][k] = min(rmq_up[i][j][k-1], rmq_up[i][j + (1 << (k-1))][k-1]);
                rmq_down[i][j][k] = min(rmq_down[i][j][k-1], rmq_down[i][j + (1 << (k-1))][k-1]);
            }
        }
    }

    map<rect,int> rect_s;

    for(int i = 0;i<n;i++){
        for(int j = 0;j<n;j++){
            if(grid[i][j])continue;
            int l = j - look_left[i][j] + 1, r = j + look_right[i][j] - 1;
            int up = i - get_rmq_up(i,l,r) + 1, down = i + get_rmq_down(i,l,r) - 1;
            rect_s.insert({rect(point(up,l), point(down,r)),0});
        }
    }

    //cout << "rects:\n";
    int xx = 0;
    int m = rect_s.size();
    vector<rect> rects(m);
    for(pair<const rect, int> & p : rect_s){
        p.second = xx;
        rect a = p.first;
        rects[xx] = a;
        xx++;
    }
    //cout << rects << '\n';

    vector<vector<int>> pov(m);
    for(int i = 0;i<m;i++){
        rect a = rects[i];
        if(a.ul.i > 0){
            for(int l = a.ul.j, r = l; l<=a.dr.j;l=r+1){
                int i_i = a.ul.i-1;
                if(grid[i_i][l]){r = l;continue;}
                r = min(l + look_right[i_i][l] - 1, a.dr.j);
                int up = i_i - get_rmq_up(i_i,l,r) + 1, down = i_i + get_rmq_down(i_i,l,r) - 1;
                rect R = rect(point(up,l), point(down,r));
                if(rect_s.count(R))pov[i].push_back(rect_s[R]);
            }
        }
        if(a.dr.i < n-1){
            for(int l = a.ul.j, r = l; l<=a.dr.j;l=r+1){
                int i_i = a.dr.i+1;
                if(grid[i_i][l]){r = l; continue;}
                r = min(l + look_right[i_i][l] - 1, a.dr.j);
                int up = i_i - get_rmq_up(i_i,l,r) + 1, down = i_i + get_rmq_down(i_i,l,r) - 1;
                rect R = rect(point(up,l), point(down,r));
                if(rect_s.count(R))pov[i].push_back(rect_s[R]);
            }
        }
    }
    
    //cout << pov << '\n';

    vector<int> dp(m,0);
    int ans = 0;
    for(int i = 0; i < m; i++)
    {
        rect a = rects[i];
        int S = (a.dr.i - a.ul.i + 1) * (a.dr.j - a.ul.j + 1);
        S = max(S,dp[i]);
        dp[i] = S;
        for(int & b_i : pov[i]){
            rect b = rects[b_i];
            int Sb = (b.dr.i - b.ul.i - a.dr.i + a.ul.i) * (b.dr.j - b.ul.j + 1);
            dp[b_i] = max(Sb + S, dp[b_i]);
        }
        ans = max(ans, dp[i]);
    }
    //cout << dp << '\n';
    return ans;
}

// int main(){
//     cout << 
//     biggest_stadium(5, {{0, 0, 0, 0, 0},
//                         {1, 0, 0, 0, 0},
//                         {0, 0, 0, 0, 0},
//                         {0, 0, 0, 0, 0},
//                         {0, 0, 1, 0, 0}}) << '\n';
// }

Compilation message

soccer.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<int>&)':
soccer.cpp:29:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(int i = 0; i<a.size(); i++){os << a[i] << ", ";}
      |                    ~^~~~~~~~~
soccer.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<std::vector<int> >&)':
soccer.cpp:35:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for(int i = 0; i<a.size(); i++){os << a[i] << ", ";}
      |                    ~^~~~~~~~~
soccer.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<rect>&)':
soccer.cpp:50:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<rect>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for(int i = 0; i<a.size(); i++){os << a[i] << ", ";}
      |                    ~^~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 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 Correct 0 ms 612 KB ok
7 Correct 2 ms 1984 KB ok
8 Correct 48 ms 42068 KB ok
9 Correct 945 ms 791632 KB ok

Subtask #2
2.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB ok
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 348 KB ok
6 Correct 0 ms 348 KB ok
7 Partially correct 0 ms 348 KB partial
8 Correct 0 ms 344 KB ok
9 Correct 0 ms 348 KB ok
10 Correct 0 ms 348 KB ok
11 Correct 0 ms 344 KB ok
12 Correct 0 ms 348 KB ok
13 Correct 0 ms 348 KB ok

Subtask #3
5.5 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB ok
2 Correct 1 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 344 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Partially correct 0 ms 348 KB partial
9 Correct 0 ms 344 KB ok
10 Correct 0 ms 348 KB ok
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 344 KB ok
13 Correct 0 ms 348 KB ok
14 Correct 0 ms 348 KB ok
15 Correct 0 ms 348 KB ok
16 Partially correct 0 ms 348 KB partial
17 Partially correct 0 ms 348 KB partial
18 Correct 0 ms 348 KB ok
19 Correct 0 ms 348 KB ok
20 Correct 0 ms 424 KB ok
21 Correct 0 ms 604 KB ok
22 Correct 0 ms 348 KB ok
23 Correct 0 ms 348 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial

Subtask #4
4.5 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB ok
2 Correct 1 ms 344 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 0 ms 348 KB ok
9 Correct 0 ms 348 KB ok
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 344 KB ok
12 Correct 0 ms 348 KB ok
13 Correct 0 ms 348 KB ok
14 Correct 0 ms 344 KB ok
15 Correct 0 ms 348 KB ok
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 348 KB partial
20 Correct 0 ms 348 KB ok
21 Correct 0 ms 348 KB ok
22 Correct 0 ms 424 KB ok
23 Correct 0 ms 604 KB ok
24 Correct 0 ms 348 KB ok
25 Correct 0 ms 348 KB ok
26 Partially correct 0 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Correct 0 ms 348 KB ok
32 Partially correct 1 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 0 ms 348 KB ok
35 Correct 0 ms 348 KB ok
36 Correct 0 ms 344 KB ok
37 Partially correct 1 ms 348 KB partial
38 Partially correct 0 ms 436 KB partial
39 Partially correct 0 ms 348 KB partial
40 Correct 0 ms 348 KB ok
41 Partially correct 1 ms 348 KB partial

Subtask #5
4.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB ok
2 Correct 1 ms 344 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 0 ms 348 KB ok
9 Correct 0 ms 348 KB ok
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 344 KB ok
12 Correct 0 ms 348 KB ok
13 Correct 0 ms 348 KB ok
14 Correct 0 ms 344 KB ok
15 Correct 0 ms 348 KB ok
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 348 KB partial
20 Correct 0 ms 348 KB ok
21 Correct 0 ms 348 KB ok
22 Correct 0 ms 424 KB ok
23 Correct 0 ms 604 KB ok
24 Correct 0 ms 348 KB ok
25 Correct 0 ms 348 KB ok
26 Partially correct 0 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Correct 0 ms 348 KB ok
32 Partially correct 1 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 0 ms 348 KB ok
35 Correct 0 ms 348 KB ok
36 Correct 0 ms 344 KB ok
37 Partially correct 1 ms 348 KB partial
38 Partially correct 0 ms 436 KB partial
39 Partially correct 0 ms 348 KB partial
40 Correct 0 ms 348 KB ok
41 Partially correct 1 ms 348 KB partial
42 Partially correct 68 ms 42840 KB partial
43 Partially correct 66 ms 42756 KB partial
44 Partially correct 64 ms 42320 KB partial
45 Partially correct 61 ms 42072 KB partial
46 Partially correct 63 ms 42576 KB partial
47 Partially correct 51 ms 42060 KB partial
48 Correct 52 ms 42072 KB ok
49 Partially correct 64 ms 42072 KB partial
50 Partially correct 69 ms 42064 KB partial
51 Partially correct 58 ms 42324 KB partial
52 Partially correct 51 ms 42068 KB partial
53 Partially correct 47 ms 42076 KB partial
54 Partially correct 49 ms 42084 KB partial
55 Partially correct 50 ms 42072 KB partial
56 Correct 49 ms 42068 KB ok
57 Partially correct 55 ms 42064 KB partial
58 Partially correct 70 ms 42068 KB partial
59 Partially correct 57 ms 42072 KB partial

Subtask #6
7.5 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB ok
2 Correct 1 ms 344 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 348 KB ok
7 Correct 0 ms 612 KB ok
8 Correct 2 ms 1984 KB ok
9 Correct 48 ms 42068 KB ok
10 Correct 945 ms 791632 KB ok
11 Correct 0 ms 344 KB ok
12 Correct 0 ms 348 KB ok
13 Correct 0 ms 348 KB ok
14 Correct 0 ms 348 KB ok
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 344 KB ok
17 Correct 0 ms 348 KB ok
18 Correct 0 ms 348 KB ok
19 Correct 0 ms 344 KB ok
20 Correct 0 ms 348 KB ok
21 Correct 0 ms 348 KB ok
22 Correct 0 ms 348 KB ok
23 Partially correct 0 ms 348 KB partial
24 Partially correct 0 ms 348 KB partial
25 Correct 0 ms 348 KB ok
26 Correct 0 ms 348 KB ok
27 Correct 0 ms 424 KB ok
28 Correct 0 ms 604 KB ok
29 Correct 0 ms 348 KB ok
30 Correct 0 ms 348 KB ok
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 Partially correct 0 ms 348 KB partial
35 Partially correct 0 ms 348 KB partial
36 Correct 0 ms 348 KB ok
37 Partially correct 1 ms 348 KB partial
38 Partially correct 0 ms 348 KB partial
39 Correct 0 ms 348 KB ok
40 Correct 0 ms 348 KB ok
41 Correct 0 ms 344 KB ok
42 Partially correct 1 ms 348 KB partial
43 Partially correct 0 ms 436 KB partial
44 Partially correct 0 ms 348 KB partial
45 Correct 0 ms 348 KB ok
46 Partially correct 1 ms 348 KB partial
47 Partially correct 68 ms 42840 KB partial
48 Partially correct 66 ms 42756 KB partial
49 Partially correct 64 ms 42320 KB partial
50 Partially correct 61 ms 42072 KB partial
51 Partially correct 63 ms 42576 KB partial
52 Partially correct 51 ms 42060 KB partial
53 Correct 52 ms 42072 KB ok
54 Partially correct 64 ms 42072 KB partial
55 Partially correct 69 ms 42064 KB partial
56 Partially correct 58 ms 42324 KB partial
57 Partially correct 51 ms 42068 KB partial
58 Partially correct 47 ms 42076 KB partial
59 Partially correct 49 ms 42084 KB partial
60 Partially correct 50 ms 42072 KB partial
61 Correct 49 ms 42068 KB ok
62 Partially correct 55 ms 42064 KB partial
63 Partially correct 70 ms 42068 KB partial
64 Partially correct 57 ms 42072 KB partial
65 Partially correct 1280 ms 797216 KB partial
66 Partially correct 1129 ms 792848 KB partial
67 Partially correct 1044 ms 792448 KB partial
68 Partially correct 1122 ms 791928 KB partial
69 Partially correct 1163 ms 793868 KB partial
70 Partially correct 1164 ms 795216 KB partial
71 Partially correct 1020 ms 791892 KB partial
72 Partially correct 985 ms 791824 KB partial
73 Correct 996 ms 791808 KB ok
74 Correct 960 ms 791648 KB ok
75 Partially correct 970 ms 791888 KB partial
76 Correct 1014 ms 791784 KB ok
77 Partially correct 983 ms 791636 KB partial
78 Partially correct 1100 ms 793608 KB partial
79 Partially correct 986 ms 793344 KB partial
80 Partially correct 962 ms 793864 KB partial
81 Partially correct 1000 ms 794600 KB partial
82 Partially correct 1061 ms 796224 KB partial
83 Partially correct 1070 ms 793724 KB partial
84 Partially correct 900 ms 791636 KB partial
85 Partially correct 1058 ms 791740 KB partial
86 Partially correct 906 ms 791636 KB partial
87 Partially correct 963 ms 791576 KB partial
88 Correct 928 ms 791632 KB ok
89 Partially correct 954 ms 791884 KB partial
90 Partially correct 950 ms 791696 KB partial
91 Partially correct 964 ms 791820 KB partial
92 Partially correct 1002 ms 792656 KB partial
93 Partially correct 1031 ms 792716 KB partial
94 Partially correct 974 ms 792588 KB partial
95 Partially correct 994 ms 792184 KB partial
96 Partially correct 958 ms 792144 KB partial
97 Partially correct 965 ms 792152 KB partial
98 Partially correct 944 ms 791992 KB partial
99 Correct 1088 ms 791892 KB ok
100 Partially correct 1068 ms 791964 KB partial
101 Partially correct 1129 ms 792004 KB partial
102 Partially correct 1063 ms 791824 KB partial
103 Partially correct 1108 ms 791892 KB partial
104 Partially correct 1090 ms 792076 KB partial
105 Partially correct 1061 ms 792136 KB partial
106 Partially correct 1075 ms 792148 KB partial
107 Correct 1101 ms 792080 KB ok
108 Correct 1143 ms 792716 KB ok
109 Partially correct 1117 ms 792492 KB partial