Submission #1884681
Source Code Expand
#include<bits/stdc++.h> using namespace std; int N; int A[1000010]; char ans[1000010]; int id[1000010]; int main() { scanf("%d",&N); for(int i = 0; i < N; i++) { scanf("%d",A + i); id[A[i]] = i + 1; } id[N + 1] = 0; int now = 0; ans[A[0]] = 'A'; for(int i = 1; i < N; i++) { if(id[A[i - 1] + 1] < id[A[i] + 1])ans[A[i]] = now + 'A'; else { if(now == 25) { printf("-1\n"); return 0; } now++; ans[A[i]] = now + 'A'; } } for(int i = 1; i <= N; i++)printf("%c",ans[i]);printf("\n"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - suffix array |
User | unit |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 719 Byte |
Status | AC |
Exec Time | 128 ms |
Memory | 9984 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:11:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&N); ^ ./Main.cpp:14:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",A + i); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 2 ms | 4352 KB |
sample_02.txt | AC | 2 ms | 4352 KB |
test_01.txt | AC | 2 ms | 4352 KB |
test_02.txt | AC | 2 ms | 4352 KB |
test_03.txt | AC | 2 ms | 4352 KB |
test_04.txt | AC | 2 ms | 4352 KB |
test_05.txt | AC | 2 ms | 4352 KB |
test_06.txt | AC | 2 ms | 4352 KB |
test_07.txt | AC | 2 ms | 4352 KB |
test_08.txt | AC | 2 ms | 4352 KB |
test_09.txt | AC | 2 ms | 4352 KB |
test_10.txt | AC | 2 ms | 4352 KB |
test_11.txt | AC | 118 ms | 9984 KB |
test_12.txt | AC | 119 ms | 9984 KB |
test_13.txt | AC | 116 ms | 9984 KB |
test_14.txt | AC | 116 ms | 9984 KB |
test_15.txt | AC | 117 ms | 9984 KB |
test_16.txt | AC | 128 ms | 9984 KB |
test_17.txt | AC | 126 ms | 9984 KB |
test_18.txt | AC | 117 ms | 9984 KB |
test_19.txt | AC | 118 ms | 9984 KB |
test_20.txt | AC | 107 ms | 9984 KB |
test_21.txt | AC | 115 ms | 9088 KB |
test_22.txt | AC | 114 ms | 9088 KB |
test_23.txt | AC | 92 ms | 8576 KB |
test_24.txt | AC | 88 ms | 8448 KB |
test_25.txt | AC | 103 ms | 9088 KB |
test_26.txt | AC | 103 ms | 9088 KB |
test_27.txt | AC | 105 ms | 9088 KB |
test_28.txt | AC | 2 ms | 4352 KB |
test_29.txt | AC | 2 ms | 4352 KB |
test_30.txt | AC | 2 ms | 4352 KB |
test_31.txt | AC | 2 ms | 4352 KB |
test_32.txt | AC | 2 ms | 4352 KB |