Submission #979579
Source Code Expand
#include<bits/stdc++.h> using namespace std; struct node { int a,b,id; }; bool c1(node a,node b) { return a.id<b.id; } node a[100000]; int main() { int n; cin>>n; for (int i=0;i<n;i++) { cin>>a[i].id; if (i==0)a[i].a=1; else a[i].a=50000+a[i-1].a; } int need=1000000000; for (int i=n-1;i>=0;i--) { a[a[i].id-1].b=need-a[a[i].id-1].a; need--; } cout<<a[0].a; for (int i=1;i<n;i++) cout<<' '<<a[i].a; cout<<endl<<a[0].b; for (int i=1;i<n;i++) cout<<' '<<a[i].b; cout<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Construct Sequences |
User | RedNextCentury |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 629 Byte |
Status | AC |
Exec Time | 13 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 | 3 ms | 256 KB |
001.txt | AC | 3 ms | 256 KB |
002.txt | AC | 3 ms | 256 KB |
003.txt | AC | 3 ms | 256 KB |
004.txt | AC | 3 ms | 256 KB |
005.txt | AC | 13 ms | 896 KB |
006.txt | AC | 4 ms | 384 KB |
007.txt | AC | 12 ms | 768 KB |
008.txt | AC | 8 ms | 512 KB |
009.txt | AC | 12 ms | 768 KB |
010.txt | AC | 13 ms | 896 KB |
011.txt | AC | 13 ms | 896 KB |
012.txt | AC | 13 ms | 896 KB |
013.txt | AC | 13 ms | 896 KB |
014.txt | AC | 13 ms | 896 KB |
015.txt | AC | 13 ms | 896 KB |
016.txt | AC | 13 ms | 896 KB |
017.txt | AC | 13 ms | 896 KB |
018.txt | AC | 13 ms | 896 KB |
example0.txt | AC | 3 ms | 256 KB |
example1.txt | AC | 3 ms | 256 KB |
example2.txt | AC | 3 ms | 256 KB |