제출 #470635

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
470635		nicolaalexandra	보물 찾기 (CEOI13_treasure2)	C++14	0 / 100	7 ms	1008 KiB

treasure

#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++)
            query (i+1,j+1,n,n);

    for (int i=1;i<=n/2;i++)
        for (int j=1;j<=n/2;j++)
            sp[i][j] = query (1,1,n,n) - query (i+1,j+1,n,n) - get_sum(i,1,n,j,1,n) - get_sum(1,j+1,i,n,2,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: 0 / 100