Submission #2400039


Source Code Expand

#include <cstdio>
#include <iostream> 
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>

using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll INF = 1e9;
const ll MOD = 1e9 + 7;

#define REP(i, n) for(int i = 0; i < n; i++)
#define RREP(i, n) for(int i = n - 1; i >= 0; i--)
#define REP2(i, n, k) for(int i = 0; i < n; i += k)


int main()
{
	int n;
	cin >> n;

	vector<ll> a(n), b(n);
	REP(i, n) {
		ll p;
		cin >> p;
		p--;

		a[p] += i;
		b[p] += i;

		a[i] += n * i + 1;
		b[i] += n * (n - i - 1) + 1;
	}

	REP(i, n) {
		cout << a[i] << ' ';
	}
	cout << '\n';
	REP(i, n) {
		cout << b[i] << ' ';
	}
	cout << '\n';
}

Submission Info

Submission Time
Task B - Construct Sequences
User chocobo
Language C++14 (GCC 5.4.1)
Score 400
Code Size 920 Byte
Status AC
Exec Time 10 ms
Memory 896 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 22
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 896 KB
006.txt AC 3 ms 384 KB
007.txt AC 9 ms 896 KB
008.txt AC 6 ms 608 KB
009.txt AC 10 ms 896 KB
010.txt AC 10 ms 896 KB
011.txt AC 10 ms 896 KB
012.txt AC 10 ms 896 KB
013.txt AC 10 ms 896 KB
014.txt AC 10 ms 896 KB
015.txt AC 10 ms 896 KB
016.txt AC 10 ms 896 KB
017.txt AC 10 ms 896 KB
018.txt AC 10 ms 896 KB
example0.txt AC 1 ms 256 KB
example1.txt AC 1 ms 256 KB
example2.txt AC 1 ms 256 KB