Submission #1068104

#TimeUsernameProblemLanguageResultExecution timeMemory
1068104AlphaBruhSoccer Stadium (IOI23_soccer)C++17
3.50 / 100
198 ms39576 KiB
#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 (stderr)

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++){
      |                 ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...