| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 70242 | MladenP | 비밀 (JOI14_secret) | C++17 | 컴파일 에러 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "secret.h"
#define m (l+r)/2
int n,i,a[1010],d[1010][1010];void Z(int l,int r){if(l>=r)return;for(int i=m+1;i<=r;i++)d[m][i]=Secret(d[m][i-1],a[i]);for(int i=m-2;i>=l;i--)d[i][m-1]=Secret(a[i],d[i+1][m-1]);Z(l,m-1);Z(m+1, r);}void Init(int N,int A[]){for(i=1,n=N;i<=n;i++)a[i]=A[i-1],d[i][i]=a[i];Z(1,N);}int Q(int l,int r,int L,int R){if(L<m&&m<=R)return Secret(d[L][m-1],d[m][R]);if(L==mid)return d[m][R];if(mid<L)return Q(m+1,r,L,R);return Q(l,m-1,L,R);}int Query(int L,int R){L++;R++;if(L==R)return a[L];return Q(1,n,L,R);}
컴파일 시 표준 에러 (stderr) 메시지
secret.cpp: In function 'int Q(int, int, int, int)':
secret.cpp:3:360: error: 'mid' was not declared in this scope
int n,i,a[1010],d[1010][1010];void Z(int l,int r){if(l>=r)return;for(int i=m+1;i<=r;i++)d[m][i]=Secret(d[m][i-1],a[i]);for(int i=m-2;i>=l;i--)d[i][m-1]=Secret(a[i],d[i+1][m-1]);Z(l,m-1);Z(m+1, r);}void Init(int N,int A[]){for(i=1,n=N;i<=n;i++)a[i]=A[i-1],d[i][i]=a[i];Z(1,N);}int Q(int l,int r,int L,int R){if(L<m&&m<=R)return Secret(d[L][m-1],d[m][R]);if(L==mid)return d[m][R];if(mid<L)return Q(m+1,r,L,R);return Q(l,m-1,L,R);}int Query(int L,int R){L++;R++;if(L==R)return a[L];return Q(1,n,L,R);}
^~~
secret.cpp:3:360: note: suggested alternative: 'void'
int n,i,a[1010],d[1010][1010];void Z(int l,int r){if(l>=r)return;for(int i=m+1;i<=r;i++)d[m][i]=Secret(d[m][i-1],a[i]);for(int i=m-2;i>=l;i--)d[i][m-1]=Secret(a[i],d[i+1][m-1]);Z(l,m-1);Z(m+1, r);}void Init(int N,int A[]){for(i=1,n=N;i<=n;i++)a[i]=A[i-1],d[i][i]=a[i];Z(1,N);}int Q(int l,int r,int L,int R){if(L<m&&m<=R)return Secret(d[L][m-1],d[m][R]);if(L==mid)return d[m][R];if(mid<L)return Q(m+1,r,L,R);return Q(l,m-1,L,R);}int Query(int L,int R){L++;R++;if(L==R)return a[L];return Q(1,n,L,R);}
^~~
void
secret.cpp:3:382: error: 'mid' was not declared in this scope
int n,i,a[1010],d[1010][1010];void Z(int l,int r){if(l>=r)return;for(int i=m+1;i<=r;i++)d[m][i]=Secret(d[m][i-1],a[i]);for(int i=m-2;i>=l;i--)d[i][m-1]=Secret(a[i],d[i+1][m-1]);Z(l,m-1);Z(m+1, r);}void Init(int N,int A[]){for(i=1,n=N;i<=n;i++)a[i]=A[i-1],d[i][i]=a[i];Z(1,N);}int Q(int l,int r,int L,int R){if(L<m&&m<=R)return Secret(d[L][m-1],d[m][R]);if(L==mid)return d[m][R];if(mid<L)return Q(m+1,r,L,R);return Q(l,m-1,L,R);}int Query(int L,int R){L++;R++;if(L==R)return a[L];return Q(1,n,L,R);}
^~~
secret.cpp:3:382: note: suggested alternative: 'void'
int n,i,a[1010],d[1010][1010];void Z(int l,int r){if(l>=r)return;for(int i=m+1;i<=r;i++)d[m][i]=Secret(d[m][i-1],a[i]);for(int i=m-2;i>=l;i--)d[i][m-1]=Secret(a[i],d[i+1][m-1]);Z(l,m-1);Z(m+1, r);}void Init(int N,int A[]){for(i=1,n=N;i<=n;i++)a[i]=A[i-1],d[i][i]=a[i];Z(1,N);}int Q(int l,int r,int L,int R){if(L<m&&m<=R)return Secret(d[L][m-1],d[m][R]);if(L==mid)return d[m][R];if(mid<L)return Q(m+1,r,L,R);return Q(l,m-1,L,R);}int Query(int L,int R){L++;R++;if(L==R)return a[L];return Q(1,n,L,R);}
^~~
void