# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
840166 | KLPP | Soccer Stadium (IOI23_soccer) | C++17 | 3946 ms | 550524 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long int lld;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
int table[2000][2000];
int n;
int pref[50][50];
vector<pair<int,int> >inter[1000][1000];
int tot[1000];
vector<lld> ans[1000][1000];
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
n=N;
rep(i,0,n){
rep(j,0,n){
table[i][j]=F[i][j];
}
}
rep(i,0,n){
rep(i,0,n)tot[i]=0;
rep(j,i,n){
rep(k,0,n)tot[k]+=table[j][k];
int lst=-1;
rep(k,0,n+1){
if(k==n || tot[k]>0){
if(k-lst>=2){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |