제출 #759672

#제출 시각아이디문제언어결과실행 시간메모리
759672doowey보물 찾기 (CEOI13_treasure2)C++14
34 / 100
6 ms980 KiB
#include <bits/stdc++.h> #include "treasure.h" using namespace std; typedef pair<int, int> pii; #define fi first #define se second #define mp make_pair map<pair<pii,pii>, int> Q; int ask(int i0, int j0, int i1, int j1){ if(i0 > i1 || j0 > j1) return 0; pair<pii, pii> rect = mp(mp(i0,j0), mp(i1,j1)); if(Q.count(rect)){ return Q[rect]; } return Q[rect]=countTreasure(i0,j0,i1,j1); } int n; int get_cost(int i0, int j0, int i1, int j1){ if(i0 > i1 || j0 > j1) return 0; //if(Q.count(mp(mp(i0,j0), mp(i1,j1)))) return 0; return n * n - (i1 - i0 + 1) * (j1 - j0 + 1) + 1; } void findTreasure (int _n) { n = _n; int cost0; int cost1; int cost2; int cost3; int cur_value; vector<pii> ans; for(int i = 1; i <= n; i ++ ){ for(int j = 1; j <= n; j ++ ){ cur_value = 0; if(i > n / 2 && j > n / 2){ cur_value = ask(1, 1, i, j) - ask(1, 1, i - 1, j) - ask(1, 1, i, j - 1) + ask(1, 1, i - 1, j - 1); } else if(i <= n / 2 && j > n / 2){ cur_value = ask(1, j, i, n) - ask(1, j, i - 1, n) - ask(1, j + 1, i, n) + ask(1, j + 1, i - 1, n); } else if(i > n / 2 && j <= n / 2){ cur_value = ask(i, 1, n, j) - ask(i, 1, n, j - 1) - ask(i + 1, 1, n, j) + ask(i + 1, 1, n, j - 1); } else{ cur_value = ask(i, j, n, n) - ask(i + 1, j, n, n) - ask(i, j + 1, n, n) + ask(i + 1, j + 1, n, n); } if(cur_value == 1) ans.push_back(mp(i, j)); } } for(auto x : ans) Report(x.fi, x.se); }

컴파일 시 표준 에러 (stderr) 메시지

treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:33:9: warning: unused variable 'cost0' [-Wunused-variable]
   33 |     int cost0;
      |         ^~~~~
treasure.cpp:34:9: warning: unused variable 'cost1' [-Wunused-variable]
   34 |     int cost1;
      |         ^~~~~
treasure.cpp:35:9: warning: unused variable 'cost2' [-Wunused-variable]
   35 |     int cost2;
      |         ^~~~~
treasure.cpp:36:9: warning: unused variable 'cost3' [-Wunused-variable]
   36 |     int cost3;
      |         ^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...