제출 #1262869

#제출 시각아이디문제언어결과실행 시간메모리
1262869norman165Super Dango Maker (JOI22_dango3)C++20
컴파일 에러
0 ms0 KiB
#include "dango3.h" #include <bits/stdc++.h> #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() // #define int long long #define yes() cout << "YES\n" #define no() cout << "NO\n" using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; // const int inf = 1e18; // const int mod = 1e9 + 7; // const int maxn = 1e6; // const int mod1 = 998244353; // const int mod2 = 1e18 + 1; // const int mod3 = 1e9 + 9; // const int mod4 = 333333333; // const int mod5 = 200000; // const int mod6 = 10007; // const int k = 3000; // const int w = 1e5; // const ld EPS = 1e-8; int LOG = 30; int ask(vector<int> a) { return Query(a); } void solve(int n, int m) { vector<vector<int>> ans; set<int> st; while (m--) { vector<int> res; int idx = -1; for (int i = 0; i < n * m; i++) { vector<int> go; for (int j = 0; j <= i; j++) if (!st.count(j)) go.push_back(j + 1); if (ask(go)) { idx = i; break; } } res.push_back(idx); st.insert(idx); for (int i = idx - 1; i >= -1; i--) { vector<int> go; for (int j = 0; j <= i; j++) if (!st.count(j)) go.push_back(j + 1); for (int& j : res) go.push_back(j + 1); if (ask(go) == 0) { res.push_back(i + 1); } } for (int& i : res) st.insert(i); ans.push_back(res); } for (auto& i : ans) Answer(i); } signed main() { // cout.precision(16); ios::sync_with_stdio(false); cin.tie(nullptr); int t = 1; // cin >> t; // while (t--) { // solve(); // } }

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

/usr/bin/ld: /tmp/cc4NFi5W.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccMzunx3.o:dango3.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/cc4NFi5W.o: in function `main':
grader.cpp:(.text.startup+0x111): undefined reference to `Solve(int, int)'
collect2: error: ld returned 1 exit status