oj.uz

Submission #842166

# Submission time Handle Problem Language Result Execution time Memory
842166 2023-09-02T13:11:04 Z Tenis0206 Soccer Stadium (IOI23_soccer) C++17
29.5 / 100
 263 ms 47696 KB 
#include <bits/stdc++.h>
#include "soccer.h"

using namespace std;

const int nmax = 2e3;

int n;

int a[nmax + 5][nmax + 5];

int st[nmax + 5], dr[nmax + 5];

int Minst[nmax + 5], Maxdr[nmax + 5];

bool verif()
{
    for(int i=0; i<=n; i++)
    {
        st[i] = n + 1;
        dr[i] = 0;
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            if(a[i][j]==0 && a[i][j - 1]==1)
            {
                if(st[i]!=n+1)
                {
                    return false;
                }
                st[i] = j;
            }
            if(a[i][j]==0)
            {
                dr[i] = j;
            }
        }
    }
    Minst[0] = n + 1;
    for(int i=1;i<=n;i++)
    {
        Minst[i] = min(Minst[i - 1], st[i]);
        Maxdr[i] = max(Maxdr[i - 1], dr[i]);
    }
    bool desc = false, start = false;
    stack<int> stl, str;
    for(int i=1; i<=n; i++)
    {
        if(st[i]!=n+1 && st[i - 1]==n+1 && start)
        {
            return false;
        }

        if(st[i]!=n+1)
        {
            start = true;

            if(st[i - 1]!=n+1 && st[i] < st[i - 1] && desc)
            {
                return false;
            }
            if(st[i - 1]!=n+1 && st[i] > st[i - 1])
            {
                desc = true;
            }

            if(dr[i - 1] && dr[i] > dr[i - 1] && desc)
            {
                return false;
            }
            if(dr[i - 1] && dr[i] < dr[i - 1])
            {
                desc = true;
            }

            int u_st = 0, u_dr = 0;

            while(!stl.empty() && st[i] >= st[stl.top()])
            {
                stl.pop();
            }
            if(stl.empty())
            {
                u_st = 0;
            }
            else
            {
                u_st = stl.top();
            }
            stl.push(i);

            while(!str.empty() && dr[i] <= dr[str.top()])
            {
                str.pop();
            }
            if(str.empty())
            {
                u_dr = 0;
            }
            else
            {
                u_dr = str.top();
            }
            str.push(i);

            if(Minst[u_dr] < st[i])
            {
                return false;
            }
            if(Maxdr[u_st] > dr[i])
            {
                return false;
            }
        }
    }
    return true;
}

int solve1()
{
    int x = 0, y = 0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(a[i][j])
            {
                x = i, y = j;
            }
        }
    }
    int Max = 0;
    Max = max(Max, n * n - x * y);
    Max = max(Max, n * n - x * (n - y + 1));
    Max = max(Max, n * n - (n - x + 1) * y);
    Max = max(Max, n * n - (n - x + 1) * (n - y + 1));
    return Max;
}

int solve2()
{
    return 0;
}

int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    n = N;
    int nre = 0;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            a[i][j] = F[i - 1][j - 1];
            nre += (1 - a[i][j]);
        }
    }
    for(int i=0; i<=n; i++)
    {
        a[i][0] = a[0][i] = a[i][n + 1] = a[n + 1][i] = 1;
    }
    bool ok = verif();
    if(ok)
    {
        return nre;
    }
    if(nre==n*n-1)
    {
        return solve1();
    }
    else if(n<=3)
    {
        return solve2();
    }
    return 0;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB partial

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok
2 Correct 1 ms 344 KB ok
3 Correct 1 ms 344 KB ok
4 Correct 0 ms 344 KB ok
5 Correct 0 ms 344 KB ok
6 Correct 0 ms 344 KB ok
7 Correct 1 ms 2648 KB ok
8 Correct 16 ms 6556 KB ok
9 Correct 235 ms 47440 KB ok

Subtask #2
2.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok
2 Correct 1 ms 344 KB ok
3 Partially correct 1 ms 344 KB partial
4 Partially correct 0 ms 344 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 0 ms 344 KB partial
7 Partially correct 1 ms 344 KB partial
8 Correct 1 ms 348 KB ok
9 Correct 0 ms 344 KB ok
10 Partially correct 0 ms 344 KB partial
11 Partially correct 0 ms 344 KB partial
12 Partially correct 0 ms 344 KB partial
13 Correct 0 ms 348 KB ok

Subtask #3
5.5 / 22.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 1 ms 344 KB ok
4 Partially correct 1 ms 344 KB partial
5 Partially correct 0 ms 344 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 344 KB partial
8 Partially correct 1 ms 344 KB partial
9 Correct 1 ms 348 KB ok
10 Correct 0 ms 344 KB ok
11 Partially correct 0 ms 344 KB partial
12 Partially correct 0 ms 344 KB partial
13 Partially correct 0 ms 344 KB partial
14 Correct 0 ms 348 KB ok
15 Partially correct 1 ms 344 KB partial
16 Partially correct 0 ms 348 KB partial
17 Partially correct 0 ms 344 KB partial
18 Partially correct 0 ms 344 KB partial
19 Partially correct 0 ms 344 KB partial
20 Correct 0 ms 348 KB ok
21 Correct 0 ms 344 KB ok
22 Partially correct 0 ms 348 KB partial
23 Partially correct 1 ms 344 KB partial
24 Partially correct 0 ms 344 KB partial
25 Partially correct 1 ms 344 KB partial
26 Partially correct 0 ms 344 KB partial

Subtask #4
4.5 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 1 ms 344 KB ok
4 Correct 1 ms 344 KB ok
5 Correct 0 ms 344 KB ok
6 Partially correct 1 ms 344 KB partial
7 Partially correct 0 ms 344 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 0 ms 344 KB partial
10 Partially correct 1 ms 344 KB partial
11 Correct 1 ms 348 KB ok
12 Correct 0 ms 344 KB ok
13 Partially correct 0 ms 344 KB partial
14 Partially correct 0 ms 344 KB partial
15 Partially correct 0 ms 344 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 1 ms 344 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 344 KB partial
20 Partially correct 0 ms 344 KB partial
21 Partially correct 0 ms 344 KB partial
22 Correct 0 ms 348 KB ok
23 Correct 0 ms 344 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 1 ms 344 KB partial
26 Partially correct 0 ms 344 KB partial
27 Partially correct 1 ms 344 KB partial
28 Partially correct 0 ms 344 KB partial
29 Partially correct 1 ms 344 KB partial
30 Partially correct 1 ms 2392 KB partial
31 Partially correct 1 ms 2392 KB partial
32 Partially correct 1 ms 2392 KB partial
33 Partially correct 1 ms 2392 KB partial
34 Correct 1 ms 2396 KB ok
35 Correct 1 ms 2392 KB ok
36 Partially correct 1 ms 2396 KB partial
37 Partially correct 1 ms 2392 KB partial
38 Partially correct 1 ms 2392 KB partial
39 Partially correct 1 ms 2392 KB partial
40 Partially correct 1 ms 2396 KB partial
41 Partially correct 1 ms 2392 KB partial

Subtask #5
4.0 / 16.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 1 ms 344 KB ok
4 Correct 1 ms 344 KB ok
5 Correct 0 ms 344 KB ok
6 Partially correct 1 ms 344 KB partial
7 Partially correct 0 ms 344 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 0 ms 344 KB partial
10 Partially correct 1 ms 344 KB partial
11 Correct 1 ms 348 KB ok
12 Correct 0 ms 344 KB ok
13 Partially correct 0 ms 344 KB partial
14 Partially correct 0 ms 344 KB partial
15 Partially correct 0 ms 344 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 1 ms 344 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 344 KB partial
20 Partially correct 0 ms 344 KB partial
21 Partially correct 0 ms 344 KB partial
22 Correct 0 ms 348 KB ok
23 Correct 0 ms 344 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 1 ms 344 KB partial
26 Partially correct 0 ms 344 KB partial
27 Partially correct 1 ms 344 KB partial
28 Partially correct 0 ms 344 KB partial
29 Partially correct 1 ms 344 KB partial
30 Partially correct 1 ms 2392 KB partial
31 Partially correct 1 ms 2392 KB partial
32 Partially correct 1 ms 2392 KB partial
33 Partially correct 1 ms 2392 KB partial
34 Correct 1 ms 2396 KB ok
35 Correct 1 ms 2392 KB ok
36 Partially correct 1 ms 2396 KB partial
37 Partially correct 1 ms 2392 KB partial
38 Partially correct 1 ms 2392 KB partial
39 Partially correct 1 ms 2392 KB partial
40 Partially correct 1 ms 2396 KB partial
41 Partially correct 1 ms 2392 KB partial
42 Partially correct 16 ms 6488 KB partial
43 Partially correct 16 ms 6488 KB partial
44 Partially correct 15 ms 6488 KB partial
45 Partially correct 15 ms 6488 KB partial
46 Partially correct 15 ms 6488 KB partial
47 Partially correct 15 ms 6488 KB partial
48 Correct 15 ms 6488 KB ok
49 Partially correct 15 ms 6488 KB partial
50 Partially correct 15 ms 6488 KB partial
51 Partially correct 15 ms 6492 KB partial
52 Partially correct 16 ms 6488 KB partial
53 Partially correct 15 ms 6556 KB partial
54 Partially correct 16 ms 6488 KB partial
55 Partially correct 15 ms 6488 KB partial
56 Partially correct 16 ms 6488 KB partial
57 Partially correct 15 ms 6492 KB partial
58 Partially correct 15 ms 6492 KB partial
59 Partially correct 15 ms 6488 KB partial

Subtask #6
7.5 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 1 ms 344 KB ok
4 Correct 1 ms 344 KB ok
5 Correct 0 ms 344 KB ok
6 Correct 0 ms 344 KB ok
7 Correct 0 ms 344 KB ok
8 Correct 1 ms 2648 KB ok
9 Correct 16 ms 6556 KB ok
10 Correct 235 ms 47440 KB ok
11 Partially correct 1 ms 344 KB partial
12 Partially correct 0 ms 344 KB partial
13 Partially correct 0 ms 348 KB partial
14 Partially correct 0 ms 344 KB partial
15 Partially correct 1 ms 344 KB partial
16 Correct 1 ms 348 KB ok
17 Correct 0 ms 344 KB ok
18 Partially correct 0 ms 344 KB partial
19 Partially correct 0 ms 344 KB partial
20 Partially correct 0 ms 344 KB partial
21 Correct 0 ms 348 KB ok
22 Partially correct 1 ms 344 KB partial
23 Partially correct 0 ms 348 KB partial
24 Partially correct 0 ms 344 KB partial
25 Partially correct 0 ms 344 KB partial
26 Partially correct 0 ms 344 KB partial
27 Correct 0 ms 348 KB ok
28 Correct 0 ms 344 KB ok
29 Partially correct 0 ms 348 KB partial
30 Partially correct 1 ms 344 KB partial
31 Partially correct 0 ms 344 KB partial
32 Partially correct 1 ms 344 KB partial
33 Partially correct 0 ms 344 KB partial
34 Partially correct 1 ms 344 KB partial
35 Partially correct 1 ms 2392 KB partial
36 Partially correct 1 ms 2392 KB partial
37 Partially correct 1 ms 2392 KB partial
38 Partially correct 1 ms 2392 KB partial
39 Correct 1 ms 2396 KB ok
40 Correct 1 ms 2392 KB ok
41 Partially correct 1 ms 2396 KB partial
42 Partially correct 1 ms 2392 KB partial
43 Partially correct 1 ms 2392 KB partial
44 Partially correct 1 ms 2392 KB partial
45 Partially correct 1 ms 2396 KB partial
46 Partially correct 1 ms 2392 KB partial
47 Partially correct 16 ms 6488 KB partial
48 Partially correct 16 ms 6488 KB partial
49 Partially correct 15 ms 6488 KB partial
50 Partially correct 15 ms 6488 KB partial
51 Partially correct 15 ms 6488 KB partial
52 Partially correct 15 ms 6488 KB partial
53 Correct 15 ms 6488 KB ok
54 Partially correct 15 ms 6488 KB partial
55 Partially correct 15 ms 6488 KB partial
56 Partially correct 15 ms 6492 KB partial
57 Partially correct 16 ms 6488 KB partial
58 Partially correct 15 ms 6556 KB partial
59 Partially correct 16 ms 6488 KB partial
60 Partially correct 15 ms 6488 KB partial
61 Partially correct 16 ms 6488 KB partial
62 Partially correct 15 ms 6492 KB partial
63 Partially correct 15 ms 6492 KB partial
64 Partially correct 15 ms 6488 KB partial
65 Partially correct 256 ms 47388 KB partial
66 Partially correct 248 ms 47440 KB partial
67 Partially correct 233 ms 47440 KB partial
68 Partially correct 231 ms 47440 KB partial
69 Partially correct 231 ms 47384 KB partial
70 Partially correct 227 ms 47448 KB partial
71 Partially correct 231 ms 47440 KB partial
72 Partially correct 263 ms 47392 KB partial
73 Correct 241 ms 47440 KB ok
74 Correct 249 ms 47396 KB ok
75 Partially correct 234 ms 47440 KB partial
76 Partially correct 229 ms 47440 KB partial
77 Partially correct 233 ms 47388 KB partial
78 Partially correct 233 ms 47440 KB partial
79 Partially correct 241 ms 47440 KB partial
80 Partially correct 235 ms 47440 KB partial
81 Partially correct 230 ms 47440 KB partial
82 Partially correct 230 ms 47392 KB partial
83 Partially correct 237 ms 47444 KB partial
84 Partially correct 237 ms 47392 KB partial
85 Partially correct 230 ms 47392 KB partial
86 Partially correct 242 ms 47396 KB partial
87 Partially correct 238 ms 47440 KB partial
88 Partially correct 235 ms 47440 KB partial
89 Partially correct 240 ms 47384 KB partial
90 Partially correct 232 ms 47388 KB partial
91 Partially correct 233 ms 47388 KB partial
92 Partially correct 233 ms 47440 KB partial
93 Partially correct 239 ms 47388 KB partial
94 Partially correct 233 ms 47440 KB partial
95 Partially correct 237 ms 47440 KB partial
96 Partially correct 236 ms 47440 KB partial
97 Partially correct 233 ms 47492 KB partial
98 Partially correct 232 ms 47392 KB partial
99 Partially correct 236 ms 47696 KB partial
100 Partially correct 230 ms 47440 KB partial
101 Partially correct 253 ms 47392 KB partial
102 Partially correct 228 ms 47392 KB partial
103 Partially correct 240 ms 47396 KB partial
104 Partially correct 233 ms 47384 KB partial
105 Partially correct 232 ms 47428 KB partial
106 Partially correct 243 ms 47384 KB partial
107 Partially correct 238 ms 47408 KB partial
108 Partially correct 231 ms 47388 KB partial
109 Partially correct 250 ms 47440 KB partial