Submission #1695982
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int M = 30000; const int N = 20005; int n, r[N], p[N]; int a[N], b[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 1; i <= n; ++i) cin >> p[i], r[p[i]] = i; for (int i = 1; i <= n; ++i) a[i] = M * i, b[i] = M * (n - i) + r[i]; for (int i = 1; i <= n; ++i) printf("%d ", a[i]); printf("\n"); for (int i = 1; i <= n; ++i) printf("%d ", b[i]); printf("\n"); }
Submission Info
Submission Time | |
---|---|
Task | B - Construct Sequences |
User | cheater2k |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 475 Byte |
Status | AC |
Exec Time | 6 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 | 2 ms | 384 KB |
001.txt | AC | 2 ms | 384 KB |
002.txt | AC | 1 ms | 256 KB |
003.txt | AC | 1 ms | 256 KB |
004.txt | AC | 2 ms | 384 KB |
005.txt | AC | 6 ms | 896 KB |
006.txt | AC | 2 ms | 384 KB |
007.txt | AC | 6 ms | 896 KB |
008.txt | AC | 4 ms | 640 KB |
009.txt | AC | 6 ms | 896 KB |
010.txt | AC | 6 ms | 1024 KB |
011.txt | AC | 6 ms | 896 KB |
012.txt | AC | 6 ms | 896 KB |
013.txt | AC | 6 ms | 1024 KB |
014.txt | AC | 6 ms | 1024 KB |
015.txt | AC | 6 ms | 1024 KB |
016.txt | AC | 6 ms | 1024 KB |
017.txt | AC | 6 ms | 1024 KB |
018.txt | AC | 6 ms | 896 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |
example2.txt | AC | 1 ms | 256 KB |