oj.uz

답안 #994851

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
994851 2024-06-08T07:33:50 Z 김은성(#10865) 축구 경기장 (IOI23_soccer) C++17
25 / 100
 272 ms 71252 KB 
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
int l[2009], r[2009], i;
int psumr[2009][2009], psumc[2009][2009];
bool consecutive(vector<int> vec){
    int i;
    for(i=0; i+1<vec.size(); i++){
        if(vec[i+1] != vec[i] + 1)
            return false;
    }
    return true;
}
bool bitonic(vector<int> vec){
    int i, trend = 0;
    for(i=0; i+1<vec.size(); i++){
        //printf("vec=%d %d trend=%d\n", vec[i], vec[i+1], trend);
        if(vec[i] < vec[i+1] && trend)
            return false;
        if(vec[i] > vec[i+1])
            trend = 1;
    }
    return true;
}
pair<int, int> change_trend(vector<int> vec){
    int i;
    vector<int> opt;
    int mx = -12839423;
    for(i=0; i<vec.size(); i++){
        //printf("vec[i]=%d\n", vec[i]);
        if(vec[i] > mx){
            opt.clear();
            opt.push_back(i);
            mx = vec[i];
        }
        else if(vec[i] == mx)
            opt.push_back(i);
    }
    return make_pair(opt[0], opt.back());
}
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    vector<int> temp;
    int i, j, cnt=0, n=N;
    srand(time(NULL));
    /*for(i=0; i<3; i++){
        for(j=0; j<3; j++){
            F[i][j] = rand() % 2;
            printf("%d ", F[i][j]);
        }
        printf("\n");
    }*/
    for(i=0; i<N; i++){
        vector<int> f;
        for(j=0; j<N; j++){
            if(!F[i][j])
                f.push_back(j), cnt++;
        }
        if(!f.empty()){
            if(!consecutive(f))
                return 0;
            temp.push_back(i);
            l[i] = f[0];
            r[i] = f.back();
        }
        else{
            l[i] = r[i] = -1;
        }
    }
    if(!consecutive(temp))
        return 0;
    for(i=0; i<N; i++){
        for(j=0; j<N; j++){
            psumc[i+1][j+1] = psumc[i+1][j] + F[i][j];
            psumr[i+1][j+1] = psumr[i][j+1] + F[i][j];
        }
    }
    for(i=0; i<N; i++){
        for(j=i; j<N; j++){
            //printf("i=%d l=%d r=%d\n", i,l[i], r[i]);
            if(l[i]==-1 || l[j] == -1)
                continue;
            int temp = psumr[j+1][l[i]+1] - psumr[i][l[i]+1];
            if(l[i] <= r[j])
                temp += psumc[j+1][r[j]+1] - psumc[j+1][l[i]];
            else
                temp += psumc[j+1][l[i]+1] - psumc[j+1][r[j]];

            int temp2 = psumr[j+1][r[j]+1] - psumr[i][r[j]+1];
            if(l[i] <= r[j])
                temp2 += psumc[i+1][l[i]+1] - psumc[i+1][r[j]];
            else
                temp2 += psumc[i+1][r[j]+1] - psumc[i+1][l[i]];
            //printf("i=%d j=%d temp=%d temp2=%d\n", i, j, temp, temp2);
            if(temp && temp2)
                return 0;
        }
    }
    for(i=0; i<N; i++){
        for(j=i; j<N; j++){
            //printf("i=%d l=%d r=%d\n", i,l[i], r[i]);
            if(l[i]==-1 || l[j] == -1)
                continue;
            int temp = psumr[j+1][r[i]+1] - psumr[i][r[i]+1];
            if(r[i] <= l[j])
                temp += psumc[j+1][l[j]+1] - psumc[j+1][r[i]];
            else
                temp += psumc[j+1][r[i]+1] - psumc[j+1][l[j]];

            int temp2 = psumr[j+1][l[j]+1] - psumr[i][l[j]+1];
            if(r[i] <= l[j])
                temp2 += psumc[i+1][r[i]+1] - psumc[i+1][l[j]];
            else
                temp2 += psumc[i+1][l[j]+1] - psumc[i+1][r[i]];
            //printf("i=%d j=%d temp=%d temp2=%d\n", i, j, temp, temp2);
            if(temp && temp2)
                return 0;
        }
    }
    for(i=0; i<N; i++){
        for(j=i; j<N; j++){
            //printf("i=%d l=%d r=%d\n", i,l[i], r[i]);
            if(l[i]==-1 || l[j] == -1)
                continue;
            int temp = psumr[j+1][l[i]+1] - psumr[i][l[i]+1];
            if(l[i] <= l[j])
                temp += psumc[j+1][l[j]+1] - psumc[j+1][l[i]];
            else
                temp += psumc[j+1][l[i]+1] - psumc[j+1][l[j]];

            int temp2 = psumr[j+1][l[j]+1] - psumr[i][l[j]+1];
            if(l[i] <= l[j])
                temp2 += psumc[i+1][l[i]+1] - psumc[i+1][l[j]];
            else
                temp2 += psumc[i+1][l[j]+1] - psumc[i+1][l[i]];
            //printf("i=%d j=%d temp=%d temp2=%d\n", i, j, temp, temp2);
            if(temp && temp2)
                return 0;
        }
    }
    for(i=0; i<N; i++){
        for(j=i; j<N; j++){
            //printf("i=%d l=%d r=%d\n", i,l[i], r[i]);
            if(l[i]==-1 || l[j] == -1)
                continue;
            int temp = psumr[j+1][r[i]+1] - psumr[i][r[i]+1];
            if(r[i] <= r[j])
                temp += psumc[j+1][r[j]+1] - psumc[j+1][r[i]];
            else
                temp += psumc[j+1][r[i]+1] - psumc[j+1][r[j]];

            int temp2 = psumr[j+1][r[j]+1] - psumr[i][r[j]+1];
            if(r[i] <= r[j])
                temp2 += psumc[i+1][r[i]+1] - psumc[i+1][r[j]];
            else
                temp2 += psumc[i+1][r[j]+1] - psumc[i+1][r[i]];
            //printf("i=%d j=%d temp=%d temp2=%d\n", i, j, temp, temp2);
            if(temp && temp2)
                return 0;
        }
    }
    return cnt;
}

Compilation message

soccer.cpp: In function 'bool consecutive(std::vector<int>)':
soccer.cpp:8:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for(i=0; i+1<vec.size(); i++){
      |              ~~~^~~~~~~~~~~
soccer.cpp: In function 'bool bitonic(std::vector<int>)':
soccer.cpp:16:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(i=0; i+1<vec.size(); i++){
      |              ~~~^~~~~~~~~~~
soccer.cpp: In function 'std::pair<int, int> change_trend(std::vector<int>)':
soccer.cpp:29:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(i=0; i<vec.size(); i++){
      |              ~^~~~~~~~~~~
soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:44:22: warning: unused variable 'n' [-Wunused-variable]
   44 |     int i, j, cnt=0, n=N;
      |                      ^

Subtask #0
0.0 / 0.0

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

Subtask #1
1.5 / 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 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 1 ms 348 KB partial
8 Partially correct 13 ms 2392 KB partial
9 Partially correct 202 ms 31828 KB partial

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 0 ms 348 KB partial
4 Partially correct 0 ms 348 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 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 348 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 0 ms 348 KB partial
2 Correct 1 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 1 ms 348 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 348 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 344 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 348 KB partial
23 Partially correct 1 ms 344 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

Subtask #4
4.5 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 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 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 1 ms 348 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 348 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 344 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 348 KB partial
25 Partially correct 1 ms 344 KB partial
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 344 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 344 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 0 ms 604 KB ok
35 Correct 1 ms 600 KB ok
36 Partially correct 0 ms 604 KB partial
37 Partially correct 1 ms 604 KB partial
38 Partially correct 0 ms 700 KB partial
39 Partially correct 0 ms 604 KB partial
40 Partially correct 0 ms 604 KB partial
41 Partially correct 0 ms 348 KB partial

Subtask #5
4.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 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 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 1 ms 348 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 348 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 344 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 348 KB partial
25 Partially correct 1 ms 344 KB partial
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 344 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 344 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 0 ms 604 KB ok
35 Correct 1 ms 600 KB ok
36 Partially correct 0 ms 604 KB partial
37 Partially correct 1 ms 604 KB partial
38 Partially correct 0 ms 700 KB partial
39 Partially correct 0 ms 604 KB partial
40 Partially correct 0 ms 604 KB partial
41 Partially correct 0 ms 348 KB partial
42 Partially correct 12 ms 2908 KB partial
43 Partially correct 15 ms 2908 KB partial
44 Partially correct 13 ms 2908 KB partial
45 Partially correct 15 ms 2908 KB partial
46 Partially correct 13 ms 2908 KB partial
47 Partially correct 14 ms 2832 KB partial
48 Correct 17 ms 10588 KB ok
49 Partially correct 15 ms 10588 KB partial
50 Partially correct 13 ms 2908 KB partial
51 Partially correct 13 ms 2908 KB partial
52 Partially correct 15 ms 10588 KB partial
53 Partially correct 15 ms 10588 KB partial
54 Partially correct 16 ms 10588 KB partial
55 Partially correct 15 ms 10588 KB partial
56 Partially correct 16 ms 10644 KB partial
57 Partially correct 13 ms 2908 KB partial
58 Partially correct 12 ms 2700 KB partial
59 Partially correct 12 ms 2704 KB partial

Subtask #6
7.5 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 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 348 KB ok
7 Partially correct 0 ms 348 KB partial
8 Partially correct 1 ms 348 KB partial
9 Partially correct 13 ms 2392 KB partial
10 Partially correct 202 ms 31828 KB partial
11 Partially correct 0 ms 348 KB partial
12 Partially correct 0 ms 348 KB partial
13 Partially correct 0 ms 348 KB partial
14 Partially correct 0 ms 348 KB partial
15 Partially correct 1 ms 348 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 348 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 344 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 348 KB partial
30 Partially correct 1 ms 344 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 Partially correct 0 ms 344 KB partial
35 Partially correct 0 ms 348 KB partial
36 Partially correct 0 ms 344 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 0 ms 348 KB partial
39 Correct 0 ms 604 KB ok
40 Correct 1 ms 600 KB ok
41 Partially correct 0 ms 604 KB partial
42 Partially correct 1 ms 604 KB partial
43 Partially correct 0 ms 700 KB partial
44 Partially correct 0 ms 604 KB partial
45 Partially correct 0 ms 604 KB partial
46 Partially correct 0 ms 348 KB partial
47 Partially correct 12 ms 2908 KB partial
48 Partially correct 15 ms 2908 KB partial
49 Partially correct 13 ms 2908 KB partial
50 Partially correct 15 ms 2908 KB partial
51 Partially correct 13 ms 2908 KB partial
52 Partially correct 14 ms 2832 KB partial
53 Correct 17 ms 10588 KB ok
54 Partially correct 15 ms 10588 KB partial
55 Partially correct 13 ms 2908 KB partial
56 Partially correct 13 ms 2908 KB partial
57 Partially correct 15 ms 10588 KB partial
58 Partially correct 15 ms 10588 KB partial
59 Partially correct 16 ms 10588 KB partial
60 Partially correct 15 ms 10588 KB partial
61 Partially correct 16 ms 10644 KB partial
62 Partially correct 13 ms 2908 KB partial
63 Partially correct 12 ms 2700 KB partial
64 Partially correct 12 ms 2704 KB partial
65 Partially correct 206 ms 39584 KB partial
66 Partially correct 215 ms 39508 KB partial
67 Partially correct 200 ms 39692 KB partial
68 Partially correct 188 ms 39508 KB partial
69 Partially correct 197 ms 39704 KB partial
70 Partially correct 196 ms 39508 KB partial
71 Partially correct 197 ms 39508 KB partial
72 Partially correct 193 ms 39508 KB partial
73 Correct 261 ms 71056 KB ok
74 Correct 272 ms 71252 KB ok
75 Partially correct 209 ms 70996 KB partial
76 Partially correct 201 ms 39708 KB partial
77 Partially correct 217 ms 39508 KB partial
78 Partially correct 195 ms 39712 KB partial
79 Partially correct 202 ms 39508 KB partial
80 Partially correct 194 ms 39508 KB partial
81 Partially correct 196 ms 39508 KB partial
82 Partially correct 261 ms 39508 KB partial
83 Partially correct 199 ms 39576 KB partial
84 Partially correct 205 ms 70996 KB partial
85 Partially correct 224 ms 71252 KB partial
86 Partially correct 214 ms 71252 KB partial
87 Partially correct 211 ms 71084 KB partial
88 Partially correct 208 ms 70996 KB partial
89 Partially correct 211 ms 70996 KB partial
90 Partially correct 211 ms 70996 KB partial
91 Partially correct 227 ms 71068 KB partial
92 Partially correct 199 ms 39588 KB partial
93 Partially correct 210 ms 39584 KB partial
94 Partially correct 198 ms 39576 KB partial
95 Partially correct 201 ms 39508 KB partial
96 Partially correct 231 ms 39508 KB partial
97 Partially correct 201 ms 39504 KB partial
98 Partially correct 194 ms 39508 KB partial
99 Partially correct 199 ms 39580 KB partial
100 Partially correct 197 ms 39508 KB partial
101 Partially correct 199 ms 39708 KB partial
102 Partially correct 193 ms 39776 KB partial
103 Partially correct 196 ms 39508 KB partial
104 Partially correct 257 ms 39708 KB partial
105 Partially correct 202 ms 39508 KB partial
106 Partially correct 203 ms 39696 KB partial
107 Partially correct 204 ms 39508 KB partial
108 Partially correct 206 ms 39504 KB partial
109 Partially correct 201 ms 31828 KB partial