Submission #2854229

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    // assert(i <= N);
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}

void say(vi& a){
    int N = a.size();
    printf("%d", a[0]);
    for (int i=1; i<N; ++i) printf(" %d", a[i]);
    printf("\n");
}

void solve(int N, vi& p) {
#ifdef DEBUG
    cerr << "p:" << p << endl;
#endif
    rep(i,N) --p[i];

    int m = (N+1)/2 + 1; //
    vi a(N,0), b(N,0);
    rep(i,N) {
        int _p = p[i];
        int h = i/2;
        a[_p] = 1 + m*_p + h;
        b[_p] = 1 + m*(N-1-_p) + (i-h); //N/2
    }
    say(a);
    say(b);
#ifdef DEBUG
    rep1(i,N-1){
        assert(a[i-1] < a[i]);
        assert(b[i-1] > b[i]);
    }
    int last = a[p[0]] + b[p[0]];
    rep1(i,N-1){
        int curr = a[p[i]] + b[p[i]];
        assert(last < curr);
        last = curr;
    }
#endif

}

int main() {
    vi p;
    int N = loadvec(p);
    solve(N,p);
    return 0;
}

Submission Info

Submission Time
Task B - Construct Sequences
User naoya_t
Language C++14 (GCC 5.4.1)
Score 400
Code Size 3305 Byte
Status
Exec Time 6 ms
Memory 896 KB

Compile Error

./Main.cpp: In function ‘void read_cr()’:
./Main.cpp:87:28: warning: ignoring return value of ‘char* fgets(char*, int, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
     fgets(_buf, 256, stdin);
                            ^

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 example0.txt, example1.txt, example2.txt
All 400 / 400 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 2 ms 256 KB
001.txt 1 ms 256 KB
002.txt 1 ms 256 KB
003.txt 1 ms 256 KB
004.txt 1 ms 256 KB
005.txt 5 ms 896 KB
006.txt 2 ms 384 KB
007.txt 5 ms 896 KB
008.txt 3 ms 640 KB
009.txt 5 ms 896 KB
010.txt 5 ms 896 KB
011.txt 5 ms 896 KB
012.txt 5 ms 896 KB
013.txt 6 ms 896 KB
014.txt 5 ms 896 KB
015.txt 5 ms 896 KB
016.txt 5 ms 896 KB
017.txt 5 ms 896 KB
018.txt 5 ms 896 KB
example0.txt 1 ms 256 KB
example1.txt 1 ms 256 KB
example2.txt 1 ms 256 KB