| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 238394 | 2020-06-11T00:57:24 Z | Retro3014 | 건물 4 (JOI20_building4) | C++17 | 448 ms | 40568 KB |
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define sortv(v) sort(all(v))
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define pb push_back
#define FI first
#define SE second
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define test 1
#define TEST if(test)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
const int MOD = 1000000007; // 998244353
const int INF = 2e9;
const ll INFLL = 1e18;
const int MAX_N = 1000000;
int N;
pii arr[2][MAX_N+1];
int num[MAX_N+1];
int A[MAX_N+1], B[MAX_N+1];
int cost[MAX_N+1];
int chk[MAX_N+1];
int num2[MAX_N+1];
int main(){
scanf("%d", &N);
N*=2;
int sum = 0, prv = 0;
for(int i=1; i<=N; i++) scanf("%d", &A[i]);
for(int i=1; i<=N; i++) scanf("%d", &B[i]);
for(int i=1; i<=N; i++){
int a=A[i], b=B[i];
if(a<b){
arr[0][i] = {a, 1};
arr[1][i] = {b, -1};
}else{
arr[0][i] = {b, -1};
arr[1][i] = {a, 1};
}
if(arr[0][i].first<prv){
if(arr[1][i].first<prv){
printf("-1");
return 0;
}
prv = arr[1][i].first;
sum+=arr[1][i].second;
num[i] = 1;
}else{
prv = arr[0][i].first;
sum+=arr[0][i].second;
num[i] = 0;
}
}
prv = INF;
for(int i=N; i>=1; i--){
if(num[i]==0){
if(prv>=arr[1][i].first){
if((sum<0 && arr[0][i].second<0) || (sum>0 && arr[0][i].second>0)){
num[i] = 1;
sum+=2*arr[1][i].second;
}else{
cost[i] = 2*arr[1][i].second;
num2[i] = 1;
}
}else{
if(i!=N && num[i+1]==0){
if(arr[1][i+1].first>=arr[1][i].first){
if(num2[i+1]==-1){
num2[i] = -1;
}else{
num2[i] = num2[i+1]+1;
cost[i] = cost[i+1] + 2*arr[1][i].second;
if((sum>0 && cost[i]<0) || (sum<0 && cost[i]>0)){
sum+=cost[i];
num[i] = 1;
chk[i] = num2[i]-1;
}
}
}else{
num2[i] = -1;
}
}else{
num2[i] = -1;
}
}
}
prv = arr[num[i]][i].first;
}
if(sum==0){
int mn = 0;
for(int i=1; i<=N; i++){
if(i<=mn){
num[i] = 1-num[i];
}
if(arr[num[i]][i].second==1){
printf("A");
}else{
printf("B");
}
mn = max(mn, i+chk[i]);
}
}else{
printf("-1");
}
return 0;
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 5 ms | 384 KB | Output is correct |
| 2 | Correct | 4 ms | 384 KB | Output is correct |
| 3 | Correct | 4 ms | 384 KB | Output is correct |
| 4 | Correct | 4 ms | 384 KB | Output is correct |
| 5 | Correct | 6 ms | 384 KB | Output is correct |
| 6 | Correct | 6 ms | 512 KB | Output is correct |
| 7 | Correct | 6 ms | 512 KB | Output is correct |
| 8 | Correct | 6 ms | 384 KB | Output is correct |
| 9 | Correct | 6 ms | 512 KB | Output is correct |
| 10 | Correct | 6 ms | 512 KB | Output is correct |
| 11 | Correct | 6 ms | 512 KB | Output is correct |
| 12 | Correct | 6 ms | 512 KB | Output is correct |
| 13 | Correct | 6 ms | 512 KB | Output is correct |
| 14 | Correct | 7 ms | 512 KB | Output is correct |
| 15 | Correct | 6 ms | 512 KB | Output is correct |
| 16 | Correct | 6 ms | 512 KB | Output is correct |
| 17 | Correct | 7 ms | 512 KB | Output is correct |
| 18 | Correct | 6 ms | 512 KB | Output is correct |
| 19 | Correct | 6 ms | 512 KB | Output is correct |
| 20 | Correct | 6 ms | 512 KB | Output is correct |
| 21 | Correct | 6 ms | 512 KB | Output is correct |
| 22 | Correct | 6 ms | 640 KB | Output is correct |
| 23 | Correct | 6 ms | 512 KB | Output is correct |
| 24 | Correct | 6 ms | 640 KB | Output is correct |
| 25 | Correct | 7 ms | 508 KB | Output is correct |
| 26 | Correct | 6 ms | 512 KB | Output is correct |
| 27 | Correct | 6 ms | 512 KB | Output is correct |
| 28 | Correct | 6 ms | 512 KB | Output is correct |
| 29 | Correct | 6 ms | 512 KB | Output is correct |
| 30 | Correct | 6 ms | 512 KB | Output is correct |
| 31 | Correct | 6 ms | 512 KB | Output is correct |
| 32 | Correct | 6 ms | 512 KB | Output is correct |
| 33 | Correct | 6 ms | 512 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 5 ms | 384 KB | Output is correct |
| 2 | Correct | 4 ms | 384 KB | Output is correct |
| 3 | Correct | 4 ms | 384 KB | Output is correct |
| 4 | Correct | 4 ms | 384 KB | Output is correct |
| 5 | Correct | 6 ms | 384 KB | Output is correct |
| 6 | Correct | 6 ms | 512 KB | Output is correct |
| 7 | Correct | 6 ms | 512 KB | Output is correct |
| 8 | Correct | 6 ms | 384 KB | Output is correct |
| 9 | Correct | 6 ms | 512 KB | Output is correct |
| 10 | Correct | 6 ms | 512 KB | Output is correct |
| 11 | Correct | 6 ms | 512 KB | Output is correct |
| 12 | Correct | 6 ms | 512 KB | Output is correct |
| 13 | Correct | 6 ms | 512 KB | Output is correct |
| 14 | Correct | 7 ms | 512 KB | Output is correct |
| 15 | Correct | 6 ms | 512 KB | Output is correct |
| 16 | Correct | 6 ms | 512 KB | Output is correct |
| 17 | Correct | 7 ms | 512 KB | Output is correct |
| 18 | Correct | 6 ms | 512 KB | Output is correct |
| 19 | Correct | 6 ms | 512 KB | Output is correct |
| 20 | Correct | 6 ms | 512 KB | Output is correct |
| 21 | Correct | 6 ms | 512 KB | Output is correct |
| 22 | Correct | 6 ms | 640 KB | Output is correct |
| 23 | Correct | 6 ms | 512 KB | Output is correct |
| 24 | Correct | 6 ms | 640 KB | Output is correct |
| 25 | Correct | 7 ms | 508 KB | Output is correct |
| 26 | Correct | 6 ms | 512 KB | Output is correct |
| 27 | Correct | 6 ms | 512 KB | Output is correct |
| 28 | Correct | 6 ms | 512 KB | Output is correct |
| 29 | Correct | 6 ms | 512 KB | Output is correct |
| 30 | Correct | 6 ms | 512 KB | Output is correct |
| 31 | Correct | 6 ms | 512 KB | Output is correct |
| 32 | Correct | 6 ms | 512 KB | Output is correct |
| 33 | Correct | 6 ms | 512 KB | Output is correct |
| 34 | Correct | 388 ms | 8096 KB | Output is correct |
| 35 | Correct | 416 ms | 30324 KB | Output is correct |
| 36 | Correct | 407 ms | 29816 KB | Output is correct |
| 37 | Correct | 425 ms | 30456 KB | Output is correct |
| 38 | Correct | 390 ms | 34040 KB | Output is correct |
| 39 | Correct | 372 ms | 37920 KB | Output is correct |
| 40 | Correct | 402 ms | 37240 KB | Output is correct |
| 41 | Correct | 338 ms | 31096 KB | Output is correct |
| 42 | Correct | 420 ms | 31736 KB | Output is correct |
| 43 | Correct | 448 ms | 32760 KB | Output is correct |
| 44 | Correct | 447 ms | 32636 KB | Output is correct |
| 45 | Correct | 437 ms | 32632 KB | Output is correct |
| 46 | Correct | 405 ms | 36592 KB | Output is correct |
| 47 | Correct | 399 ms | 40440 KB | Output is correct |
| 48 | Correct | 391 ms | 40568 KB | Output is correct |
| 49 | Correct | 404 ms | 37368 KB | Output is correct |
| 50 | Correct | 434 ms | 32632 KB | Output is correct |
| 51 | Correct | 428 ms | 32760 KB | Output is correct |
| 52 | Correct | 318 ms | 34552 KB | Output is correct |
| 53 | Correct | 310 ms | 34680 KB | Output is correct |
| 54 | Correct | 278 ms | 35448 KB | Output is correct |
| 55 | Correct | 286 ms | 35372 KB | Output is correct |
| 56 | Correct | 399 ms | 33524 KB | Output is correct |
| 57 | Correct | 347 ms | 35228 KB | Output is correct |
| 58 | Correct | 349 ms | 35320 KB | Output is correct |
| 59 | Correct | 333 ms | 33400 KB | Output is correct |
| 60 | Correct | 328 ms | 32424 KB | Output is correct |
| 61 | Correct | 353 ms | 34296 KB | Output is correct |
| 62 | Correct | 332 ms | 35192 KB | Output is correct |
| 63 | Correct | 351 ms | 35576 KB | Output is correct |
| 64 | Correct | 334 ms | 33784 KB | Output is correct |
| 65 | Correct | 349 ms | 34936 KB | Output is correct |