제출 #575390

#제출 시각아이디문제언어결과실행 시간메모리
575390UzoufA Difficult(y) Choice (BOI21_books)C++14
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> #include"books.h" using namespace std; //using namespace __gnu_pbds; //#define ll long long //#define endl "\n" //int mod=1e9+7; //const int N=2e5+5; //template<class x> //using ordered_multiset = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>; void solve(int N, int K, long long A, int S) { multiset<int> st; int v[N]; for (int i=0;i<N;i++) { v[i]=skim(i+1); st.insert(v[i]); } int a=-1,b=-1,c=-1; for (int l=0;l<N;l++) { for (int r=l+1;r<N;r++) { long long need=A-(v[l]+v[r]+1); auto mid=st.upper_bound(need); if (mid==st.end()) continue; if (*mid==v[l]) mid=st.upper_bound(*mid); if (mid==st.end()) continue; if (*mid==v[r]) mid=st.upper_bound(*mid); if (mid==st.end()) continue; //cout<<v[l]<<' '<<*mid<<' '<<v[r]<<endl; long long chk=*mid+v[l]+v[r]; if (chk>=A && chk<=na) { a=v[l]; b=*mid; c=v[r]; break; } } } if (a==-1) impossible(); vector<int> ans; ans.push_back(a); ans.push_back(b); ans.push_back(c); //cout<<a<<' '<<b<<' '<<c; answer(ans); return; }

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

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:37:28: error: 'na' was not declared in this scope; did you mean 'a'?
   37 |         if (chk>=A && chk<=na) {
      |                            ^~
      |                            a