Submission #1987352
Source Code Expand
# include <iostream> # include <algorithm> # include <vector> # include <string> # include <set> # include <map> # include <cmath> # include <iomanip> # include <functional> # include <utility> # include <stack> # include <queue> # include <list> # include <tuple> # include <unordered_map> # include <numeric> # include <complex> # include <bitset> using namespace std; using LL = long long; using ULL = unsigned long long; constexpr int INF = 2000000000; constexpr int HINF = INF / 2; constexpr double DINF = 100000000000000000.0; constexpr long long LINF = 9223372036854775807; constexpr long long HLINF = 4500000000000000000; constexpr long long MMOD = 500000004; const double PI = acos(-1); int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 }; # define ALL(x) (x).begin(),(x).end() # define UNIQ(c) (c).erase(unique(ALL((c))), end((c))) # define mp make_pair # define eb emplace_back # define FOR(i,a,b) for(int i=(a);i<(b);++i) # define REP(i,n) FOR(i,0,n) # define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); int a[202020], b[202020], n,p[202020]; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> p[i]; p[i]--; } for (int i = 0; i < n; i++) { a[i] = b[n - i - 1] = 45000 * i + 1; } for (int i = 0; i < n; i++)a[p[i]] += i; for (int i = 0; i < n; i++) { cout << a[i] << (i == n - 1 ? "\n" : " "); } for (int i = 0; i < n; i++) { cout << b[i] << (i == n - 1 ? "\n" : " "); } }
Submission Info
Submission Time | |
---|---|
Task | B - Construct Sequences |
User | M3_cp |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1504 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 896 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 | 256 KB |
001.txt | AC | 2 ms | 256 KB |
002.txt | AC | 2 ms | 256 KB |
003.txt | AC | 1 ms | 256 KB |
004.txt | AC | 2 ms | 256 KB |
005.txt | AC | 12 ms | 896 KB |
006.txt | AC | 3 ms | 384 KB |
007.txt | AC | 10 ms | 768 KB |
008.txt | AC | 6 ms | 512 KB |
009.txt | AC | 11 ms | 896 KB |
010.txt | AC | 12 ms | 896 KB |
011.txt | AC | 12 ms | 896 KB |
012.txt | AC | 12 ms | 896 KB |
013.txt | AC | 12 ms | 896 KB |
014.txt | AC | 12 ms | 896 KB |
015.txt | AC | 12 ms | 896 KB |
016.txt | AC | 12 ms | 896 KB |
017.txt | AC | 12 ms | 896 KB |
018.txt | AC | 11 ms | 896 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |
example2.txt | AC | 1 ms | 256 KB |