제출 #1260785

#제출 시각아이디문제언어결과실행 시간메모리
1260785inkvizytorQuestion (Grader is different from the original contest) (CEOI14_question_grader)C++20
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long vector<int> msk = {0}; void solve1() { int x, y; cin >> x >> y; int m1 = msk[x], m2 = msk[y]; for (int i = 0; i < 12; i++) { if ((m1&(1<<i)) && ((m2&(1<<i))==0)) { cout << i+1 << '\n'; return; } } } void solve2() { int q, h; cin >> q >> h; if (msk[q]&(1<<(h-1))) { cout << "yes\n"; return; } else { cout << "no\n"; return; } } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); for (int i = 0; i < (1<<12); i++) { if (__builtin_popcount(i) == 6) { msk.push_back(i); } } int a; cin >> a; if (a == 1) { int n, t; cin >> n >> t; for (int i = 0; i < t; i++) solve1(); } else { int n, t; cin >> n >> t; for (int i = 0; i < t; i++) solve2(); } }
#include <bits/stdc++.h> using namespace std; #define ll long long vector<int> msk = {0}; void solve1() { int x, y; cin >> x >> y; int m1 = msk[x], m2 = msk[y]; for (int i = 0; i < 12; i++) { if ((m1&(1<<i)) && ((m2&(1<<i))==0)) { cout << i+1 << '\n'; return; } } } void solve2() { int q, h; cin >> q >> h; if (msk[q]&(1<<(h-1))) { cout << "yes\n"; return; } else { cout << "no\n"; return; } } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); for (int i = 0; i < (1<<12); i++) { if (__builtin_popcount(i) == 6) { msk.push_back(i); } } int a; cin >> a; if (a == 1) { int n, t; cin >> n >> t; for (int i = 0; i < t; i++) solve1(); } else { int n, t; cin >> n >> t; for (int i = 0; i < t; i++) solve2(); } }

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

# 1번째 컴파일 단계

/usr/bin/ld: /tmp/ccfmVQOR.o: in function `main':
grader_encode.c:(.text.startup+0x0): multiple definition of `main'; /tmp/ccetnmZe.o:encoder.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/ccfmVQOR.o: in function `main':
grader_encode.c:(.text.startup+0x125): undefined reference to `encode(int, int, int)'
collect2: error: ld returned 1 exit status