# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
417638 | 2021-06-04T05:02:04 Z | 장태환(#7548) | Parking Problem (innopolis2021_final_A) | C++17 | 31 ms | 852 KB |
#include <bits/stdc++.h> using namespace std; int main() { int T; ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> T; while(T--) { string a,b; cin >> a >> b ; int i; int c=0; priority_queue<int>x; for(i=0;i<a.size();i++) { if(a[i]=='X') { if(c>1) x.push(c-1); c=0; } else c++; } if(c>1) x.push(c-1); for(i=0;i<b.size();i++) { cout <<((x.size())?'Y':'N'); if(x.size()) { auto to=x.top(); x.pop(); if(b[i]=='M') to-=2; else to-=3; if(to>0) x.push(to); } } cout <<((x.size())?'Y':'N'); cout <<'\n'; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 716 KB | Output is correct |
2 | Correct | 13 ms | 460 KB | Output is correct |
3 | Correct | 28 ms | 576 KB | Output is correct |
4 | Correct | 14 ms | 788 KB | Output is correct |
5 | Correct | 13 ms | 524 KB | Output is correct |
6 | Correct | 15 ms | 836 KB | Output is correct |
7 | Correct | 13 ms | 460 KB | Output is correct |
8 | Correct | 27 ms | 588 KB | Output is correct |
9 | Correct | 11 ms | 704 KB | Output is correct |
10 | Correct | 13 ms | 500 KB | Output is correct |
11 | Correct | 29 ms | 644 KB | Output is correct |
12 | Correct | 11 ms | 792 KB | Output is correct |
13 | Correct | 12 ms | 460 KB | Output is correct |
14 | Correct | 27 ms | 620 KB | Output is correct |
15 | Correct | 22 ms | 512 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 852 KB | Output is correct |
2 | Correct | 14 ms | 588 KB | Output is correct |
3 | Correct | 30 ms | 588 KB | Output is correct |
4 | Incorrect | 13 ms | 748 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 21 ms | 720 KB | Output is correct |
2 | Correct | 19 ms | 588 KB | Output is correct |
3 | Correct | 17 ms | 548 KB | Output is correct |
4 | Correct | 20 ms | 472 KB | Output is correct |
5 | Correct | 20 ms | 516 KB | Output is correct |
6 | Correct | 23 ms | 516 KB | Output is correct |
7 | Correct | 27 ms | 588 KB | Output is correct |
8 | Correct | 31 ms | 576 KB | Output is correct |
9 | Correct | 25 ms | 536 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 716 KB | Output is correct |
2 | Correct | 13 ms | 460 KB | Output is correct |
3 | Correct | 28 ms | 576 KB | Output is correct |
4 | Correct | 14 ms | 788 KB | Output is correct |
5 | Correct | 13 ms | 524 KB | Output is correct |
6 | Correct | 15 ms | 836 KB | Output is correct |
7 | Correct | 13 ms | 460 KB | Output is correct |
8 | Correct | 27 ms | 588 KB | Output is correct |
9 | Correct | 11 ms | 704 KB | Output is correct |
10 | Correct | 13 ms | 500 KB | Output is correct |
11 | Correct | 29 ms | 644 KB | Output is correct |
12 | Correct | 11 ms | 792 KB | Output is correct |
13 | Correct | 12 ms | 460 KB | Output is correct |
14 | Correct | 27 ms | 620 KB | Output is correct |
15 | Correct | 22 ms | 512 KB | Output is correct |
16 | Correct | 12 ms | 852 KB | Output is correct |
17 | Correct | 14 ms | 588 KB | Output is correct |
18 | Correct | 30 ms | 588 KB | Output is correct |
19 | Incorrect | 13 ms | 748 KB | Output isn't correct |
20 | Halted | 0 ms | 0 KB | - |