oj.uz

답안 #475665

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
475665 2021-09-23T15:41:06 Z stefantaga 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 5 ms 1100 KB 
#include <bits/stdc++.h>
#include "treasure.h"
#define DIM 110
#define mp make_pair
using namespace std;
 
int a[DIM][DIM],sp[DIM][DIM];
map <pair<pair<int,int>,pair<int,int> >, int > f;
int n,i,j;
 
int query (int x, int y, int x2, int y2){
    if (f[mp(mp(x,y),mp(x2,y2))])
        return f[mp(mp(x,y),mp(x2,y2))];
    int val = countTreasure(x,y,x2,y2);
    f[mp(mp(x,y),mp(x2,y2))] = val;
    return val;
}
 
int get_sum (int x, int y, int x2, int y2, int tip, int n){
    if (tip == 1)
        return query (x,y,n,n) - query (x,y+1,n,n);
    return query (x,y,n,n) - query (x2+1,y,n,n);
}
 
void findTreasure (int n) {
 
    for (int i=n/2+1;i<=n;i++)
        for (int j=n/2+1;j<=n;j++)
            sp[i][j] = query(1,1,i,j);
 
    for (int i=n/2+1;i<=n;i++)
        for (int j=1;j<=n/2;j++)
            sp[i][j] = query (1,1,i,n) - query (1,j+1,i,n);
 
    for (int i=1;i<=n/2;i++)
        for (int j=n/2+1;j<=n;j++)
            sp[i][j] = query (1,1,n,j) - query (i+1,1,n,j);
 
    for (int i=1;i<=n/2;i++)
        for (int j=1;j<=n/2;j++)
            sp[i][j] = sp[n][j] + sp[i][n] + query (i+1,j+1,n,n) - sp[n][n];
 
 
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
            a[i][j] = sp[i][j] - sp[i-1][j] - sp[i][j-1] + sp[i-1][j-1];
 
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
            if (a[i][j])
                Report (i,j);
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 1 ms 332 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 1 ms 332 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 1 ms 332 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 2 ms 588 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 2 ms 692 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 3 ms 688 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 3 ms 844 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 5 ms 1100 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 5 ms 1084 KB Output is correct - N = 100, K = 43760000, score = 10