Submission #3594674
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> P; typedef tuple<int, int, int> T; int MOD=1e9+7; ll INF=1e18; int dx[]={1, -1, 0, 0}; int dy[]={0, 0, 1, -1}; int main(){ int n; cin>>n; vector<int> a(n), b(n); for(int i=0; i<n; i++){ a[i]=n*(i+1); b[i]=n*(n-i); } for(int i=0; i<n; i++){ int p; cin>>p; p--; a[p]+=i; } for(int i=0; i<n; i++){ if(i!=n-1) cout << a[i] << " "; else cout << a[i] << endl; } for(int i=0; i<n; i++){ if(i!=n-1) cout << b[i] << " "; else cout << b[i] << endl; } }
Submission Info
Submission Time | |
---|---|
Task | B - Construct Sequences |
User | rodea0952 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 685 Byte |
Status | AC |
Exec Time | 11 ms |
Memory | 768 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 | 10 ms | 768 KB |
006.txt | AC | 3 ms | 384 KB |
007.txt | AC | 9 ms | 768 KB |
008.txt | AC | 6 ms | 512 KB |
009.txt | AC | 10 ms | 768 KB |
010.txt | AC | 10 ms | 768 KB |
011.txt | AC | 10 ms | 768 KB |
012.txt | AC | 10 ms | 768 KB |
013.txt | AC | 10 ms | 768 KB |
014.txt | AC | 11 ms | 768 KB |
015.txt | AC | 10 ms | 768 KB |
016.txt | AC | 10 ms | 768 KB |
017.txt | AC | 10 ms | 768 KB |
018.txt | AC | 10 ms | 768 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |
example2.txt | AC | 1 ms | 256 KB |