제출 #1263907

#제출 시각아이디문제언어결과실행 시간메모리
1263907anteknneSecret (JOI14_secret)C++20
컴파일 에러
0 ms0 KiB
#include "secret.h" #include<bits/stdc++.h> #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef long long ll; typedef long double ld; #define pb push_back #define pii pair<int, int> #define pll pair<ll, ll> #define st first #define nd second #define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> #define debug false const int MAXN = 1000 + 17; int a[MAXN]; int m[4 * MAXN][MAXN]; int n; void dziel (int p, int k, int i) { if (p == k) { m[i][p] = a[p]; return; } int sr = (p + k)/ 2; dziel(p, sr, i * 2); dziel(sr + 1, k, i * 2 + 1); m[i][sr] = a[sr]; for (int j = sr - 1; j >= p; j --) { m[i][j] = Pytaj(a[j], m[i][j + 1]); } if (sr + 1 <= k) { m[i][sr + 1] = a[sr + 1]; } for (int j = sr + 2; j <= k; j ++) { m[i][j] = Pytaj(m[i][j - 1], a[j]); } } void Init(int N, vector<int> A) { n = N; for (int i = 0; i < n; i ++) { a[i] = A[i]; } dziel(0, n - 1, 1); } int wyn = -1; void odczytaj (int p, int k, int i, int l, int r) { if (wyn != -1 || p > r || k < l) { return; } if (p == k) { wyn = a[p]; return; } int sr = (p + k)/ 2; if (l <= sr && r > sr) { wyn = Pytaj(m[i][l], m[i][r]); return; } if (r <= sr) { odczytaj(p, sr, i * 2, l, r); } else { odczytaj(sr + 1, k, i * 2 + 1, l, r); } } int Query(int l, int r) { wyn = -1; //cout << 0 << " " << n - 1 << "\n"; odczytaj(0, n - 1, 1, l, r); return wyn; }

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

secret.cpp: In function 'void dziel(int, int, int)':
secret.cpp:36:19: error: 'Pytaj' was not declared in this scope
   36 |         m[i][j] = Pytaj(a[j], m[i][j + 1]);
      |                   ^~~~~
secret.cpp:42:19: error: 'Pytaj' was not declared in this scope
   42 |         m[i][j] = Pytaj(m[i][j - 1], a[j]);
      |                   ^~~~~
secret.cpp: In function 'void odczytaj(int, int, int, int, int)':
secret.cpp:67:15: error: 'Pytaj' was not declared in this scope
   67 |         wyn = Pytaj(m[i][l], m[i][r]);
      |               ^~~~~