# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
648082 | 2022-10-05T10:38:22 Z | baibhav26062008 | Intercastellar (JOI22_ho_t1) | C++14 | 87 ms | 3956 KB |
#include <bits/stdc++.h> using namespace std; int main() { int N;cin>>N; int A[N]; for (int i=0; i<N; i++) { cin >> A[i]; } int Q; cin>>Q; int X[Q]; for (int i=0; i<Q; i++) { cin >> X[i]; } vector<int>L; for (int i = 0; i < N; i++) { int curr = A[i]; int ctr = 0; while (curr % 2 == 0) { curr /= 2; } for (int i = 0; i < (A[i]/curr); i++) { L.push_back(curr); } // (aL.push_back(curr); if (A[i] % 2 != 0) L.push_back(curr); } // (it x : L) cout << x << for (int i = 0; i < Q; i++) { cout << L[X[i]-1] << endl; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Incorrect | 87 ms | 3956 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 304 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 296 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Runtime error | 2 ms | 468 KB | Execution killed with signal 11 |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Incorrect | 87 ms | 3956 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |