제출 #1191980

#제출 시각아이디문제언어결과실행 시간메모리
1191980trvhungMutating DNA (IOI21_dna)C++20
컴파일 에러
0 ms0 KiB
#include "dna.h" #include <bits/stdc++.h> // #include <ext/rope> // #include <ext/pb_ds/assoc_container.hpp> // using namespace __gnu_pbds; // using namespace __gnu_cxx; using namespace std; // #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> #define ll long long #define ull unsigned long long #define ld long double #define pb push_back #define bit(mask, i) ((mask >> i) & 1) #define el '\n' #define F first #define S second template <class X, class Y> bool maximize(X &x, const Y &y) { return (x < y ? x = y, 1 : 0); } template <class X, class Y> bool minimize(X &x, const Y &y) { return (x > y ? x = y, 1 : 0); } const int INF = 1e9; const ll LINF = 1e18; const int MOD = 1e9 + 7; const int MULTI = 0; const ld eps = 1e-9; const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; // R D L U const int ddx[4] = {-1, 1, 1, -1}, ddy[4] = {1, 1, -1, -1}; // UR DR DL UL const char cx[4] = {'R', 'D', 'L', 'U'}; const ll base = 31; const int nMOD = 2; const ll mods[] = {(ll)1e9 + 10777, (ll)1e9 + 19777, (ll)1e9 + 3, (ll)1e9 + 3777}; const int MAX = 1e5 + 5; int n, pref[MAX]; string s, t; void init(string a, string b) { n = (int) a.size(); s = ' ' + a; t = ' ' + b; for (int i = 1; i <= n; ++i) pref[i] = pref[i - 1] + (s[i] != t[i]); } int get_distance(int x, int y) { ++x; ++y; int s = pref[y] - pref[x - 1]; return (s & 1 ? -1 : s >> 1); } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); if (!MULTI) solve(); else { int test; cin >> test; while (test--) solve(); } return 0; }

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

dna.cpp: In function 'int main()':
dna.cpp:57:17: error: 'solve' was not declared in this scope
   57 |     if (!MULTI) solve();
      |                 ^~~~~
dna.cpp:60:24: error: 'solve' was not declared in this scope
   60 |         while (test--) solve();
      |                        ^~~~~