답안 #1068104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1068104 2024-08-21T07:38:22 Z AlphaBruh 축구 경기장 (IOI23_soccer) C++17
3.5 / 100
198 ms 39576 KB
#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
#define P pair<int,int>
int tot=0;
P emprg(vector<int>x){
    P ret;
    int cnt=0,fst=x.size(),lst=-1;
    for(int i=0;i<x.size();i++){
        if(x[i]==0){
            cnt++;
            fst=min(fst,i);
            lst=max(lst,i);
        }
    }
    tot+=cnt;
    if(lst-fst+1 == cnt){
        ret.first=fst;
        ret.second=lst;
        return ret;
    }
    ret.first=-2;
    return ret;
}
int rla(P prf, P nxt){
    if(prf.first == nxt.first && prf.second == nxt.second) return 0;
    if (prf.first <= nxt.first && prf.second >= nxt.second) return -1;
    if(prf.first >= nxt.first && prf.second <= nxt.second) return 1;
    return -2;
}
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    bool inc=1;
    tot=0;
    P prf;
    vector<P>allr;
    for(int i=0;i<N;i++){
        P get(emprg(F[i]));
        if(get.first==-2) return 0;
        if(i>0){
            int x=rla(prf,get);
            if(x==-2) return 0;
            else if(x==-1) inc=0;
            else if(x==1 && inc==0) return 0; 
        }
        prf=get;
        allr.push_back(get);
    }
    for(int i=0;i<N;i++){
        for(int j=0;j<i;j++){
            if(rla(allr[i],allr[j])==-2) return 0;
        }
    }
    return tot;
}

Compilation message

soccer.cpp: In function 'std::pair<int, int> emprg(std::vector<int>)':
soccer.cpp:9:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for(int i=0;i<x.size();i++){
      |                 ~^~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 1 ms 344 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 1 ms 448 KB partial
8 Partially correct 13 ms 2904 KB partial
9 Partially correct 198 ms 39576 KB partial
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 1 ms 344 KB ok
3 Partially correct 1 ms 348 KB partial
4 Partially correct 0 ms 348 KB partial
5 Partially correct 1 ms 348 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 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 1 ms 348 KB partial
12 Partially correct 0 ms 348 KB partial
13 Correct 0 ms 348 KB ok
# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 344 KB ok
4 Partially correct 1 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 348 KB partial
8 Partially correct 0 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 1 ms 348 KB partial
13 Partially correct 0 ms 348 KB partial
14 Correct 0 ms 348 KB ok
15 Partially correct 0 ms 344 KB partial
16 Partially correct 0 ms 348 KB partial
17 Partially correct 1 ms 348 KB partial
18 Partially correct 1 ms 348 KB partial
19 Partially correct 1 ms 436 KB partial
20 Incorrect 1 ms 348 KB wrong
21 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 344 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 1 ms 348 KB ok
6 Partially correct 1 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 1 ms 348 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 0 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 1 ms 348 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 0 ms 344 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 1 ms 348 KB partial
20 Partially correct 1 ms 348 KB partial
21 Partially correct 1 ms 436 KB partial
22 Incorrect 1 ms 348 KB wrong
23 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 344 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 1 ms 348 KB ok
6 Partially correct 1 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 1 ms 348 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 0 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 1 ms 348 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 0 ms 344 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 1 ms 348 KB partial
20 Partially correct 1 ms 348 KB partial
21 Partially correct 1 ms 436 KB partial
22 Incorrect 1 ms 348 KB wrong
23 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 344 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 1 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Partially correct 0 ms 348 KB partial
8 Partially correct 1 ms 448 KB partial
9 Partially correct 13 ms 2904 KB partial
10 Partially correct 198 ms 39576 KB partial
11 Partially correct 1 ms 348 KB partial
12 Partially correct 0 ms 348 KB partial
13 Partially correct 1 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 Correct 0 ms 348 KB ok
18 Partially correct 0 ms 348 KB partial
19 Partially correct 1 ms 348 KB partial
20 Partially correct 0 ms 348 KB partial
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 1 ms 348 KB partial
25 Partially correct 1 ms 348 KB partial
26 Partially correct 1 ms 436 KB partial
27 Incorrect 1 ms 348 KB wrong
28 Halted 0 ms 0 KB -