Submission #1495961


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> pip;
typedef pair<pll, pll> P;
const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS = 1e-9;
const bool debug = 0;
//---------------------------------//

int N;
int a[1123456], rev[1123456];

int main() {
	cin >> N;
	REP(i, N) {
		scanf("%d", a + i);
		a[i]--;
		rev[a[i]] = i;
	}
	rev[N] = -1;
	
	string ans(N, '~');
	int now = 0;
	
	ans[a[0]] = 'A';
	FOR(i, 1, N) {
		int bn = rev[a[i - 1] + 1];
		int nn = rev[a[i] + 1];
		if (bn > nn) now++;
		if (now == 26) break;
		
		ans[a[i]] = now + 'A';
	}
	
	if (ans.find('~') != string::npos) puts("-1");
	else cout << ans << endl;
	
	return 0;
}

Submission Info

Submission Time
Task D - suffix array
User tkmst201
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1154 Byte
Status AC
Exec Time 115 ms
Memory 10496 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:27:21: 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
AC × 2
AC × 34
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 2304 KB
sample_02.txt AC 2 ms 2304 KB
test_01.txt AC 2 ms 2304 KB
test_02.txt AC 2 ms 2304 KB
test_03.txt AC 2 ms 2304 KB
test_04.txt AC 2 ms 2304 KB
test_05.txt AC 2 ms 2304 KB
test_06.txt AC 2 ms 2304 KB
test_07.txt AC 2 ms 2304 KB
test_08.txt AC 2 ms 2304 KB
test_09.txt AC 2 ms 2304 KB
test_10.txt AC 2 ms 2304 KB
test_11.txt AC 114 ms 10496 KB
test_12.txt AC 115 ms 10496 KB
test_13.txt AC 114 ms 10496 KB
test_14.txt AC 114 ms 10496 KB
test_15.txt AC 113 ms 10496 KB
test_16.txt AC 114 ms 10496 KB
test_17.txt AC 114 ms 10496 KB
test_18.txt AC 114 ms 10496 KB
test_19.txt AC 115 ms 10496 KB
test_20.txt AC 104 ms 10496 KB
test_21.txt AC 114 ms 9472 KB
test_22.txt AC 113 ms 9472 KB
test_23.txt AC 97 ms 9344 KB
test_24.txt AC 92 ms 9216 KB
test_25.txt AC 107 ms 9472 KB
test_26.txt AC 107 ms 9472 KB
test_27.txt AC 107 ms 9472 KB
test_28.txt AC 2 ms 2304 KB
test_29.txt AC 2 ms 2304 KB
test_30.txt AC 1 ms 2304 KB
test_31.txt AC 1 ms 2304 KB
test_32.txt AC 2 ms 2304 KB