Submission #62044259
Source Code Expand
Copy
#include<bits/stdc++.h>using namespace std;int main(){int A[10],B[10],ans,i;for(i=0;i<5;i++){cin>>A[i];}for(i=0;i<5;i++){B[i]=A[i];}ans=0;int n,j;if(ans==0){for(i=0;i<4;i++){ans=1;n=B[i];B[i]=B[i+1];B[i+1]=n;
#include<bits/stdc++.h> using namespace std; int main(){ int A[10],B[10],ans,i; for(i=0;i<5;i++){ cin>>A[i]; } for(i=0;i<5;i++){ B[i]=A[i]; } ans=0; int n,j; if(ans==0){ for(i=0;i<4;i++){ ans=1; n=B[i]; B[i]=B[i+1]; B[i+1]=n; for(j=0;j<4;j++){ if(B[j]>B[j+1]){ ans=0; } } if(ans==1){ break; } B[i]=A[i]; B[i+1]=A[i+1]; } } if(ans==0){ cout<<"No"; }else{ cout<<"Yes"; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 12435 |
User | taroki |
Language | C++ 17 (gcc 12.2) |
Score | 150 |
Code Size | 550 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 3676 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 150 / 150 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt |
All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_handmade_00.txt, 01_handmade_01.txt, 01_handmade_02.txt, 02_Yes_00.txt, 02_Yes_01.txt, 03_No_00.txt, 03_No_01.txt, 03_No_02.txt, 03_No_03.txt, 03_No_04.txt, 03_No_05.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_00.txt | AC | 1 ms | 3480 KB |
00_sample_01.txt | AC | 1 ms | 3608 KB |
00_sample_02.txt | AC | 1 ms | 3480 KB |
00_sample_03.txt | AC | 1 ms | 3452 KB |
01_handmade_00.txt | AC | 1 ms | 3472 KB |
01_handmade_01.txt | AC | 1 ms | 3676 KB |
01_handmade_02.txt | AC | 1 ms | 3448 KB |
02_Yes_00.txt | AC | 1 ms | 3536 KB |
02_Yes_01.txt | AC | 1 ms | 3472 KB |
03_No_00.txt | AC | 1 ms | 3536 KB |
03_No_01.txt | AC | 1 ms | 3536 KB |
03_No_02.txt | AC | 1 ms | 3472 KB |
03_No_03.txt | AC | 1 ms | 3616 KB |
03_No_04.txt | AC | 1 ms | 3488 KB |
03_No_05.txt | AC | 1 ms | 3528 KB |