Submission #979569
Source Code Expand
#include <bits/stdc++.h> using namespace std; int p[20000]; int a[20000]; int b[20000]; int main() { int n; cin >> n; for (int i = 0; i < n; i++){ cin >> p[i]; p[i]--; } for (int i = 0; i < n; i++) a[i] = i + 1, b[i] = n - i; int val = 2 * n; for (int i = n - 1; i > 0; i--){ for (int j = p[i]; j < n; j++) a[j] += val; for (int j = p[i]; j >= 0; j--) b[j] += val; val--; } for (int i = 0; i < n; i++) cout << a[i] << ' '; cout << '\n'; for (int i = 0; i < n; i++) cout << b[i] << ' '; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Construct Sequences |
User | IsmagilS |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 678 Byte |
Status | AC |
Exec Time | 293 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt, example2.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, example0.txt, example1.txt, example2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 6 ms | 256 KB |
001.txt | AC | 4 ms | 256 KB |
002.txt | AC | 4 ms | 256 KB |
003.txt | AC | 3 ms | 256 KB |
004.txt | AC | 5 ms | 256 KB |
005.txt | AC | 284 ms | 896 KB |
006.txt | AC | 15 ms | 384 KB |
007.txt | AC | 229 ms | 768 KB |
008.txt | AC | 82 ms | 512 KB |
009.txt | AC | 264 ms | 768 KB |
010.txt | AC | 293 ms | 896 KB |
011.txt | AC | 292 ms | 896 KB |
012.txt | AC | 292 ms | 896 KB |
013.txt | AC | 292 ms | 896 KB |
014.txt | AC | 293 ms | 1024 KB |
015.txt | AC | 293 ms | 896 KB |
016.txt | AC | 293 ms | 896 KB |
017.txt | AC | 292 ms | 896 KB |
018.txt | AC | 293 ms | 896 KB |
example0.txt | AC | 3 ms | 256 KB |
example1.txt | AC | 3 ms | 256 KB |
example2.txt | AC | 3 ms | 256 KB |