제출 #321080

#제출 시각아이디문제언어결과실행 시간메모리
321080monus1042보물 찾기 (CEOI13_treasure2)C++17
44 / 100
20 ms492 KiB
#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;

int ans[105][105];

void findTreasure (int N) {
    //int cnt = countTreasure(1, 1, N, N);
    //if(cnt > 0) Report (1, 1);
	ans[1][1] = countTreasure(1,1, 1,1);
	for (int i=1; i<=N; i++){
		for (int j=1; j<=N; j++){
			if (j==i && j == 1) continue;
			int acc = 0;
			for (int k=1; k<=i; k++){
				for (int l=1; l<=j; l++){
					acc += ans[k][l];
				}
			}
			/*for (int k=1; k<=i; k++){
				for (int l=1; l<=j - 1; l++){
					acc -= acc[k][l];
				}
			}
			for (int k=1; k<=i - 1; k++){
				for (int l=1; l<=j; l++){
					acc -= acc[k][l];
				}
			}
			for (int k=1; k<=i - 1; k++){
				for (int l=1; l<=j - 1; l++){
					acc += acc[k][l];
				}
				}*/
			ans[i][j] = countTreasure(1,1, i,j) - acc;
		}
	}

	for (int i=1; i<=N; i++){
		for (int j=1; j<=N; j++){
			if (ans[i][j]) Report(i,j);
		}
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...