| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 168275 | arnold518 | Adriatic (CEOI13_adriatic) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 25e4;
const int M = 8;
struct Point { int x, y; };
int N, B[M+10][M+10];
Point A[MAXN+10];
int cnt[M+10][M+10];
int p1[M+10][M+10], q1[M+10][M+10];
int p2[M+10][M+10], q2[M+10][M+10];
int x1[M+10][M+10], y1[M+10][M+10];
int x2[M+10][M+10], y2[M+10][M+10];
int dp1[M+10][M+10], dp2[M+10][M+10];
int numpoint(int y1, int y2, int x1, int x2)
{
if(x1>x2) swap(x1, x2);
if(y1>y2) swap(y1, y2);
return cnt[y2][x2]-cnt[y1-1][x2]-cnt[y2][x1-1]+cnt[y1-1][x1-1];
}
int main()
{
int i, j;
scanf("%d", &N);
for(i=1; i<=N; i++) scanf("%d%d", &A[i].y, &A[i].x), B[A[i].y][A[i].x]++;
for(i=1; i<=M; i++) for(j=1; j<=M; j++) cnt[i][j]=cnt[i-1][j]+cnt[i][j-1]-cnt[i-1][j-1]+B[i][j];
for(i=1; i<=M; i++)
{
q1[M+1][i]=M+1;
q1[i][0]=M+1;
}
q1[M+1][0]=M+1;
for(i=M; i>=0; i--) for(j=1; j<=M+1; j++)
{
p1[i][j]=max(p1[i+1][j], p1[i][j-1]);
if(B[i][j]) p1[i][j]=j;
q1[i][j]=min(q1[i+1][j], q1[i][j-1]);
if(B[i][j]) q1[i][j]=i;
}
for(i=1; i<=M; i++)
{
p2[0][i]=M+1;
p2[i][M+1]=M+1;
}
p2[0][M+1]=M+1;
for(i=1; i<=M+1; i++) for(j=M; j>=0; j--)
{
p2[i][j]=min(p2[i-1][j], p2[i][j+1]);
if(B[i][j]) p2[i][j]=j;
q2[i][j]=max(q2[i-1][j], q2[i][j+1]);
if(B[i][j]) q2[i][j]=i;
}
for(i=0; i<=M+1; i++) for(j=0; j<=M+1; j++)
{
x1[i][j]=min(p2[i][1], p2[M][j]);
y1[i][j]=max(q2[i][1], q2[M][j]);
x2[i][j]=max(p1[i][M], p1[1][j]);
y2[i][j]=min(q1[i][M], q1[1][j]);
}
for(i=M; i>=1; i--) for(j=1; j<=M; j++)
{
dp1[i][j]=dp1[max(i, y1[i-1][j+1])][min(j, x1[i-1][j+1])]+numpoint(i, M, 1, j);
}
for(i=1; i<=M; i++) for(j=M; j>=1; j--)
{
dp2[i][j]=dp2[min(i, y2[i+1][j-1])][max(j, x2[i+1][j-1])]+numpoint(1, i, j, M);
}
for(i=1; i<=N; i++) printf("%d\n", N+dp1[A[i].y][A[i].x]+dp2[A[i].y][A[i].x]-3);
/* printf("================\n");
for(i=1; i<=M; i++) { for(j=1; j<=M; j++) printf("%d ", dp1[i][j]); printf("\n"); };
printf("================\n");
for(i=1; i<=M; i++) { for(j=1; j<=M; j++) printf("%d ", dp2[i][j]); printf("\n"); }; */
}