답안 #659197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
659197	2022-11-17T01:32:46 Z	as111	보물 찾기 (CEOI13_treasure2)	C++14	컴파일 오류	0 ms	0 KB

treasure

#include <iostream>

#define MAXN 100

using namespace std;
int ps[MAXN + 5][MAXN + 5]; // partial sum # treasure
int ans[MAXN + 5][MAXN + 5];
int total = 0;
void query(int r1, int c1, int r2, int c2) {
	cout << r1 << " " << c1 << " " << r2 << " " << c2 << endl;
	total += (r2 - r1 + 1) * (c2 - c1 + 1);
}
int main() {
	int N;
	cin >> N;
	query(1, 1, N, N);
	cin >> ps[N][N];
	for (int r = N; r >= 2; r--) {
		for (int c = N; c >= 2; c--) {
			int l, tl, t; // left, top left, top
			if (!ps[r][c - 1]) {
				query(1, 1, r, c - 1);
				cin >> ps[r][c - 1];
			}
			if (!ps[r - 1][c - 1]) {
				query(1, 1, r - 1, c - 1);
				cin >> ps[r - 1][c - 1];
			}
			if (!ps[r - 1][c]) {
				query(1, 1, r - 1, c);
				cin >> ps[r - 1][c];
			}
			ans[r][c] = ps[r][c] - ps[r - 1][c] - ps[r][c - 1] + ps[r - 1][c - 1];
		}
	}
	for (int r = N; r >= 1; r--) {
		ans[r][1] = ps[r][2] - ps[r - 1][2] - ans[r][2];
	}
	for (int c = N; c >= 1; c--) {
		ans[1][c] = ps[2][c] - ps[2][c-1] - ans[2][c];
	}

	for (int r = 1; r <= N; r++) {
		for (int c = 1; c <= N; c++) {
			cout << ans[r][c];
		}
		cout << endl;
	}
	cout << total;
}

Compilation message

treasure.cpp: In function 'int main()':
treasure.cpp:20:8: warning: unused variable 'l' [-Wunused-variable]
   20 |    int l, tl, t; // left, top left, top
      |        ^
treasure.cpp:20:11: warning: unused variable 'tl' [-Wunused-variable]
   20 |    int l, tl, t; // left, top left, top
      |           ^~
treasure.cpp:20:15: warning: unused variable 't' [-Wunused-variable]
   20 |    int l, tl, t; // left, top left, top
      |               ^
/usr/bin/ld: /tmp/cc5sSqQV.o: in function `main':
treasure.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/cchNV8WW.o:grader.c:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/cchNV8WW.o: in function `main':
grader.c:(.text.startup+0x103): undefined reference to `findTreasure(int)'
collect2: error: ld returned 1 exit status