제출 #278038

#제출 시각아이디문제언어결과실행 시간메모리
278038erkamXylophone (JOI18_xylophone)C++17
컴파일 에러
0 ms0 KiB
#include<iostream> #include<cstdio> #include<algorithm> #include<cmath> #include<utility> #include<vector> #include<stack> #include<queue> #include<cstring> #include<set> #include "xylophone.h" #include<map> #define endl "\n" #define all(v) v.begin(),v.end() #define st first #define nd second #define mp make_pair #define pb push_back using namespace std; typedef long long lo; const int mod=1000000007,N=500005; lo a,b,c,d,e,f,g=1,h[N]; pair<lo,lo>arr[N]; string s; vector<lo>v; // int query(int a,int b){ } // void answer(int a,int b){ } void solve(int n){ for(lo i=1;i<n;i++){ arr[i].st=query(i,i+1); if(i<n-1)arr[i].nd=query(i,i+2); } h[1]=1; for(lo i=1;i<=n-2;i++){ if(arr[i].st+arr[i+1].st==arr[i].nd)h[i+1]=h[i]; else h[i+1]=(h[i]^1); } bool ok=0; map<lo,lo>maap; lo mx=0,sum=0; for(lo i=1;i<n;i++){ if(h[i]==0)sum-=arr[i].st; else sum+=arr[i].st; if(maap[sum]==1){ok=1; break;} maap[sum]++; mx=max(sum,mx); } if(ok==0 and mx-mn==n-1){ lo hehe=n-mx; answer(1,hehe); for(lo i=1;i<n;i++){ hehe+=arr[i].st*(h[i]==0?-1:1); answer(i+1,hehe); } return; } h[1]=0; for(lo i=1;i<n;i++){ if(h[i]==0)sum-=arr[i].st; else sum+=arr[i].st; mx=max(sum,mx); } lo hehe=n-mx; answer(1,hehe); for(lo i=1;i<n;i++){ hehe+=arr[i].st*(h[i]==0?-1:1); answer(i+1,hehe); } } // int main(){ // #ifdef local // freopen("in.txt","r",stdin); // freopen("out.txt","w",stdout); // #endif // ios_base::sync_with_stdio(false); // cin.tie(NULL); cout.tie(NULL); // // cin >> g; // // while(g--)solve(); // }

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

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:50:18: error: 'mn' was not declared in this scope; did you mean 'mx'?
   50 |  if(ok==0 and mx-mn==n-1){
      |                  ^~
      |                  mx