oj.uz

Submission #168281

# Submission time Handle Problem Language Result Execution time Memory
168281 2019-12-12T08:38:50 Z arnold518 Adriatic (CEOI13_adriatic) C++14
100 / 100
 384 ms 200568 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#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 = 2500;

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 dp1[M+10][M+10], dp2[M+10][M+10];

int numpoint(int yy1, int yy2, int x1, int x2)
{
    if(x1>x2) swap(x1, x2);
    if(yy1>yy2) swap(yy1, yy2);
    return cnt[yy2][x2]-cnt[yy1-1][x2]-cnt[yy2][x1-1]+cnt[yy1-1][x1-1];
}

int xx1(int i, int j) { return min(p2[i][1], p2[M][j]); }
int yy1(int i, int j) { return max(q2[i][1], q2[M][j]); }
int xx2(int i, int j) { return max(p1[i][M], p1[1][j]); }
int yy2(int i, int j) { return min(q1[i][M], q1[1][j]); }

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=M; i>=1; i--) for(j=1; j<=M; j++)
    {
        dp1[i][j]=dp1[max(i, yy1(i-1, j+1))][min(j, xx1(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, yy2(i+1, j-1))][max(j, xx2(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"); }; */
}

Compilation message

adriatic.cpp: In function 'int main()':
adriatic.cpp:40:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
     ~~~~~^~~~~~~~~~
adriatic.cpp:41:56: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=1; i<=N; i++) scanf("%d%d", &A[i].y, &A[i].x), B[A[i].y][A[i].x]++;
                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 172792 KB Output is correct
2 Correct 230 ms 172920 KB Output is correct
3 Correct 230 ms 172792 KB Output is correct
4 Correct 233 ms 172508 KB Output is correct
5 Correct 230 ms 172724 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 233 ms 176860 KB Output is correct
2 Correct 231 ms 177788 KB Output is correct
3 Correct 233 ms 177000 KB Output is correct
4 Correct 233 ms 172952 KB Output is correct
5 Correct 230 ms 173176 KB Output is correct
6 Correct 236 ms 175096 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 180848 KB Output is correct
2 Correct 239 ms 185984 KB Output is correct
3 Correct 240 ms 181412 KB Output is correct
4 Correct 235 ms 174012 KB Output is correct
5 Correct 231 ms 173780 KB Output is correct
6 Correct 264 ms 182520 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 183412 KB Output is correct
2 Correct 253 ms 196748 KB Output is correct
3 Correct 251 ms 183544 KB Output is correct
4 Correct 244 ms 175836 KB Output is correct
5 Correct 241 ms 174960 KB Output is correct
6 Correct 268 ms 183252 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 345 ms 187428 KB Output is correct
2 Correct 383 ms 200568 KB Output is correct
3 Correct 384 ms 195056 KB Output is correct
4 Correct 361 ms 183928 KB Output is correct
5 Correct 338 ms 180556 KB Output is correct
6 Correct 362 ms 189016 KB Output is correct
7 Correct 359 ms 188280 KB Output is correct