제출 #1162270

#제출 시각아이디문제언어결과실행 시간메모리
1162270dubabubaGift Exchange (JOI24_ho_t4)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h> using namespace std; const int mxn = 1e6 + 10; int n, a[mxn], b[mxn]; int main() { cin >> n; for(int i = 1; i <= n; i++) { cin >> a[i]; } for(int i = 1; i <= n; i++) { cin >> b[i]; assert(b[i] == 1); } cout << "Yes\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...