QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #166465 | #7120. Soccer | youngsystem# | 6 | 190ms | 128748kb | C++14 | 1.8kb | 2023-09-06 13:13:02 | 2023-09-06 13:13:02 |
Judging History
answer
#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
int s[2005][2005];
int f[2005][2005][5];
int now[2005];
int sta[2005],ttop;
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
if(N==1)return 1;
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
{
s[i][j]=F[i-1][j-1];
}
}
for(int i=1;i<=N;i++)now[i]=0;
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
{
if(s[i][j]==1)
{
now[j]=i;
}
}
ttop=0;
sta[0]=0;
int ans=0;
for(int j=1;j<=N;j++)
{
while(ttop>=1&&now[j]>now[sta[ttop]])
{
ans-=(sta[ttop]-sta[ttop-1])*now[sta[ttop]];
ttop--;
}
ans+=(j-sta[ttop])*now[j];
f[i][j][1]=ans;
sta[++ttop]=j;
}
ttop=0;
ans=0;
sta[0]=N+1;
for(int j=N;j>=1;j--)
{
while(ttop>=1&&now[j]>now[sta[ttop]])
{
ans-=(sta[ttop-1]-sta[ttop])*now[sta[ttop]];
ttop--;
}
ans+=(sta[ttop]-j)*now[j];
f[i][j][2]=ans;
sta[++ttop]=j;
}
}
for(int i=1;i<=N;i++)now[i]=0;
for(int i=N;i>=1;i--)
{
for(int j=1;j<=N;j++)
{
if(s[i][j]==1)
{
now[j]=N-i+1;
}
}
ttop=0;
sta[0]=0;
int ans=0;
for(int j=1;j<=N;j++)
{
while(ttop>=1&&now[j]>now[sta[ttop]])
{
ans-=(sta[ttop]-sta[ttop-1])*now[sta[ttop]];
ttop--;
}
ans+=(j-sta[ttop])*now[j];
f[i][j][3]=ans;
sta[++ttop]=j;
}
ttop=0;
ans=0;
sta[0]=N+1;
for(int j=N;j>=1;j--)
{
while(ttop>=1&&now[j]>now[sta[ttop]])
{
ans-=(sta[ttop-1]-sta[ttop])*now[sta[ttop]];
ttop--;
}
ans+=(sta[ttop]-j)*now[j];
f[i][j][4]=ans;
sta[++ttop]=j;
}
}
int zz=0;
for(int i=1;i<=N-1;i++)
{
for(int j=1;j<=N-1;j++)
{
zz=max(zz,N*N-(f[i][j][1]+f[i][j+1][2]+f[i+1][j][3]+f[i+1][j+1][4]));
}
}
return zz;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 6
Accepted
Test #1:
score: 6
Accepted
time: 2ms
memory: 3744kb
input:
R0R7sb2atQWJ6SAWOjw4ZG7Gwgo5zl9L 1 0
output:
xlqtkQVzqzbOJxjzxlqsyVrlM2kqlbK0 OK 1
result:
ok ok
Test #2:
score: 6
Accepted
time: 2ms
memory: 6136kb
input:
R0R7sb2atQWJ6SAWOjw4ZG7Gwgo5zl9L 3 0 0 0 0 1 0 0 0 0
output:
xlqtkQVzqzbOJxjzxlqsyVrlM2kqlbK0 OK 5
result:
ok ok
Test #3:
score: 6
Accepted
time: 3ms
memory: 10380kb
input:
R0R7sb2atQWJ6SAWOjw4ZG7Gwgo5zl9L 100 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
xlqtkQVzqzbOJxjzxlqsyVrlM2kqlbK0 OK 9850
result:
ok ok
Test #4:
score: 6
Accepted
time: 15ms
memory: 30184kb
input:
R0R7sb2atQWJ6SAWOjw4ZG7Gwgo5zl9L 500 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
xlqtkQVzqzbOJxjzxlqsyVrlM2kqlbK0 OK 236536
result:
ok ok
Test #5:
score: 6
Accepted
time: 190ms
memory: 128748kb
input:
R0R7sb2atQWJ6SAWOjw4ZG7Gwgo5zl9L 2000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
output:
xlqtkQVzqzbOJxjzxlqsyVrlM2kqlbK0 OK 3786181
result:
ok ok
Test #6:
score: 6
Accepted
time: 1ms
memory: 6168kb
input:
R0R7sb2atQWJ6SAWOjw4ZG7Gwgo5zl9L 9 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
output:
xlqtkQVzqzbOJxjzxlqsyVrlM2kqlbK0 OK 80
result:
ok ok
Test #7:
score: 6
Accepted
time: 0ms
memory: 5860kb
input:
R0R7sb2atQWJ6SAWOjw4ZG7Gwgo5zl9L 10 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
output:
xlqtkQVzqzbOJxjzxlqsyVrlM2kqlbK0 OK 99
result:
ok ok
Test #8:
score: 6
Accepted
time: 1ms
memory: 5868kb
input:
R0R7sb2atQWJ6SAWOjw4ZG7Gwgo5zl9L 3 0 0 0 0 0 0 0 0 1
output:
xlqtkQVzqzbOJxjzxlqsyVrlM2kqlbK0 OK 8
result:
ok ok
Test #9:
score: 6
Accepted
time: 2ms
memory: 6152kb
input:
R0R7sb2atQWJ6SAWOjw4ZG7Gwgo5zl9L 3 0 0 0 0 0 0 1 0 0
output:
xlqtkQVzqzbOJxjzxlqsyVrlM2kqlbK0 OK 8
result:
ok ok
Subtask #2:
score: 0
Wrong Answer
Test #10:
score: 8
Accepted
time: 0ms
memory: 5848kb
input:
R0R7sb2atQWJ6SAWOjw4ZG7Gwgo5zl9L 3 0 0 0 0 1 0 0 1 1
output:
xlqtkQVzqzbOJxjzxlqsyVrlM2kqlbK0 OK 5
result:
ok ok
Test #11:
score: 8
Accepted
time: 0ms
memory: 7844kb
input:
R0R7sb2atQWJ6SAWOjw4ZG7Gwgo5zl9L 3 0 0 0 0 1 1 0 0 1
output:
xlqtkQVzqzbOJxjzxlqsyVrlM2kqlbK0 OK 5
result:
ok ok
Test #12:
score: 0
Wrong Answer
time: 1ms
memory: 6144kb
input:
R0R7sb2atQWJ6SAWOjw4ZG7Gwgo5zl9L 3 0 0 1 0 0 0 1 1 0
output:
xlqtkQVzqzbOJxjzxlqsyVrlM2kqlbK0 OK 6
result:
wrong answer wrong
Subtask #3:
score: 0
Skipped
Dependency #2:
0%
Subtask #4:
score: 0
Skipped
Dependency #3:
0%
Subtask #5:
score: 0
Skipped
Dependency #4:
0%
Subtask #6:
score: 0
Skipped
Dependency #1:
100%
Accepted
Dependency #2:
0%