제출 #103160

#제출 시각아이디문제언어결과실행 시간메모리
103160bert30702커다란 상품 (IOI17_prize)C++17
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> #include "prize.h" #define pii pair<int, int> #define F first #define S second using namespace std; unordered_map<int, pii> mp; pii query(int p) { if(mp.find(p) != mp.end()) return mp[p]; vector<int> v = ask(p); return mp[p] = {v[0], v[1]}; } vector<pii> ans; void dfs(int l, int r, pii a, pii b) { if(l == r) return ans.push_back({b.F + b.S, l}); if(a == b) return; int m = l + r >> 1; pii v = query(m); if(v.F + v.S != mx) { ans.push_back({v.F + v.S, m}); if(m != l) dfs(l, m - 1, a, query(m - 1)); if(m != r) dfs(m + 1, r, query(m + 1), b); } else { if(v == a) return dfs(m + 1, r, v, b); if(v == b) return dfs( l, m, a, v); dfs( l, m, a, v); dfs(m + 1, r, v, b); } } int find_best(int n) { dfs(0, n - 1, query(0), query(n - 1)); for(auto it: ans) if(it.F == 0) return it.S; }

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

prize.cpp: In function 'void dfs(int, int, std::pair<int, int>, std::pair<int, int>)':
prize.cpp:17:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int m = l + r >> 1;
          ~~^~~
prize.cpp:19:18: error: 'mx' was not declared in this scope
  if(v.F + v.S != mx) {
                  ^~
prize.cpp:19:18: note: suggested alternative: 'm'
  if(v.F + v.S != mx) {
                  ^~
                  m
prize.cpp: In function 'int find_best(int)':
prize.cpp:34:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^