Submission #978929
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long LL; typedef pair<LL,LL> PII; int main() { int N; cin >> N; vector<LL> input; for(int i=0; i<N; i++) { int p; cin >> p; input.push_back(p); } vector<LL> a,b; LL base = 30000; for(int i=0; i<N; i++) { a.push_back(i * base+1); b.push_back((N-1-i) * base + 1); } for(int i=0; i<N; i++) { a[input[i]-1] += i; } for(int i=0; i<N; i++) { cout << a[i]; if(i<N-1) cout << " "; else cout << endl; } for(int i=0; i<N; i++) { cout << b[i]; if(i<N-1) cout << " "; else cout << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Construct Sequences |
User | tokoharu |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 664 Byte |
Status | AC |
Exec Time | 20 ms |
Memory | 1316 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 | 3 ms | 384 KB |
001.txt | AC | 3 ms | 384 KB |
002.txt | AC | 3 ms | 384 KB |
003.txt | AC | 3 ms | 256 KB |
004.txt | AC | 3 ms | 384 KB |
005.txt | AC | 13 ms | 1316 KB |
006.txt | AC | 4 ms | 512 KB |
007.txt | AC | 12 ms | 1188 KB |
008.txt | AC | 8 ms | 768 KB |
009.txt | AC | 12 ms | 1316 KB |
010.txt | AC | 13 ms | 1316 KB |
011.txt | AC | 13 ms | 1316 KB |
012.txt | AC | 13 ms | 1316 KB |
013.txt | AC | 13 ms | 1316 KB |
014.txt | AC | 13 ms | 1316 KB |
015.txt | AC | 13 ms | 1316 KB |
016.txt | AC | 13 ms | 1316 KB |
017.txt | AC | 20 ms | 1316 KB |
018.txt | AC | 13 ms | 1316 KB |
example0.txt | AC | 2 ms | 256 KB |
example1.txt | AC | 3 ms | 256 KB |
example2.txt | AC | 3 ms | 256 KB |