Submission #979571
Source Code Expand
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define POWT(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODU 1000000007
#define bitcheck(a,b) ((a >> b) & 1)
#define bitset(a,b) ( a |= (1 << b))
#define bitunset(a,b) (a &= ~(1 << b))
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const pii four_Dir[4] = {
{ 0,-1 },{ -1 ,0 },{ 0 ,1 },
{ 1 ,0 }
};
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
std::fill((T*) array, (T*) (array + N), val);
}
signed main() {
int n;
scanf("%d", &n);
vector<int> p(n);
REP(i, n) {
scanf("%d", &p[i]);
p[i]--;
}
vector<int> ans(n);
REP(i, n) {
ans[i] = (n-i + 1)*n;
printf("%d ", (i + 1)*n);
}
REP(i, n) {
ans[p[i]] -= n-i-1;
}
printf("\n");
REP(i, n) {
printf("%d ", ans[i]);
}
printf("\n");
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Construct Sequences |
User |
Gear |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1403 Byte |
Status |
AC |
Exec Time |
8 ms |
Memory |
768 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:42:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:45:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &p[i]);
^
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 |
2 ms |
256 KB |
002.txt |
AC |
3 ms |
256 KB |
003.txt |
AC |
2 ms |
256 KB |
004.txt |
AC |
3 ms |
256 KB |
005.txt |
AC |
8 ms |
768 KB |
006.txt |
AC |
3 ms |
384 KB |
007.txt |
AC |
7 ms |
756 KB |
008.txt |
AC |
5 ms |
512 KB |
009.txt |
AC |
8 ms |
768 KB |
010.txt |
AC |
8 ms |
768 KB |
011.txt |
AC |
8 ms |
768 KB |
012.txt |
AC |
8 ms |
768 KB |
013.txt |
AC |
8 ms |
768 KB |
014.txt |
AC |
8 ms |
768 KB |
015.txt |
AC |
8 ms |
768 KB |
016.txt |
AC |
8 ms |
768 KB |
017.txt |
AC |
8 ms |
768 KB |
018.txt |
AC |
8 ms |
768 KB |
example0.txt |
AC |
2 ms |
256 KB |
example1.txt |
AC |
2 ms |
256 KB |
example2.txt |
AC |
2 ms |
256 KB |