oj.uz

답안 #42492

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
42492 2018-02-27T18:06:13 Z nonocut 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 6 ms 1884 KB 
#include "treasure.h"
#include<bits/stdc++.h>
using namespace std;

int s[105][105];
map<int,map<int,map<int,map<int,int>>>> mp;

int get(int r1,int c1,int r2,int c2) {
    if(!mp[r1][c1][r2][c2]) mp[r1][c1][r2][c2] = countTreasure(r1,c1,r2,c2);
    return mp[r1][c1][r2][c2];
}

void findTreasure (int N) {
    //section 4
    for(int i=N/2+1;i<=N;i++) {
        for(int j=N/2+1;j<=N;j++) {
            s[i][j] = get(1,1,i,j);
        }
    }
    //section 3
    for(int i=1;i<=N/2;i++) {
        for(int j=N/2+1;j<=N;j++) {
            s[i][j] = s[N][j] - get(i+1,1,N,j);
        }
    }
    //section 2
    for(int i=N/2+1;i<=N;i++) {
        for(int j=1;j<=N/2;j++) {
            s[i][j] = s[i][N] - get(1,j+1,i,N);
        }
    }
    //section1
    for(int i=1;i<=N/2;i++) {
        for(int j=1;j<=N/2;j++) {
            s[i][j] = s[N][j] + s[i][N] + get(i+1,j+1,N,N) - s[N][N];
        }
    }
    for(int i=1;i<=N;i++) {
        for(int j=1;j<=N;j++) {
            if(s[i][j]-s[i-1][j]-s[i][j-1]+s[i-1][j-1]) Report(i,j);
//            printf("%d ",s[i][j]);
        }
//        printf("\n");
    }
}

Compilation message

grader.c: In function 'int main()':
grader.c:63:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         my_assert(strlen(A[i]+1) == N, "each line of the map must contain N zeroes or ones (before loop)");
                                  ^

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 376 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 1 ms 376 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 2 ms 424 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 1 ms 496 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 2 ms 932 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 3 ms 1060 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 3 ms 1316 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 4 ms 1572 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 6 ms 1880 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 5 ms 1884 KB Output is correct - N = 100, K = 43760000, score = 10