AtCoder Grand Contest 008

Submission #1045331

Source codeソースコード

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

int main() {
  int n;
  scanf("%d", &n);
  vi x(n);
  vector<pii> x_sorted(n);
  vvi a(n, vi(n, -1)); // 最後に各要素を+1
  rep (i, n) {
    scanf("%d", &x[i]);
    x[i] -= 1;
    a[i][i] = x[i];
    x_sorted[i] = (make_pair(x[i], i));
  }
  sort(all(x_sorted));
  vi order(n*n);
  rep (i, n*n) {
    order[i] = i;
  }
  for (int i = n-1; i >= 0; --i) {
    order.erase(begin(order) + x_sorted[i].first);
  }

  rep (i, n) {
    int xi = x_sorted[i].first;
    if (lower_bound(all(order), xi) - begin(order) < x_sorted[i].second) {
      printf("No\n");
      return 0;
    }
    rep (j, x_sorted[i].second) {
      a[x_sorted[i].second][j] = order[j];
    }
    order.erase(begin(order), begin(order) + x_sorted[i].second);
  }


  rep (i, n) {
    if (order.empty()) {
      break;
    }
    int xi = x_sorted[i].first;
    if (order.at(0) < xi) {
      printf("No\n");
      return 0;
    }
    int offset = x_sorted[i].second + 1;
    FOR (j, offset, n) {
      a[x_sorted[i].second][j] = order[j - offset];
    }
    order.erase(begin(order), begin(order) + (n - offset));
  }

  vi a_print(n*n);
  rep (i, n) {
    rep (j, n) {
      a_print[a[i][j]] = i + 1;
    }
  }
  printf("Yes\n");
  rep (i, n*n-1) {
    printf("%d ", a_print[i]);
  }
  printf("%d\n", a_print[n*n-1]);

  return 0;
}

Submission

Task問題 D - K-th K
User nameユーザ名 mu
Created time投稿日時
Language言語 C++14 (Clang 3.8.0)
Status状態 AC
Score得点 800
Source lengthソースコード長 2266 Byte
File nameファイル名
Exec time実行時間 71 ms
Memory usageメモリ使用量 4096 KB

Test case

Set

Set name Score得点 / Max score Cases
Sample - 0_00.txt,0_01.txt
All 800 / 800 0_00.txt,0_01.txt,1_00.txt,1_01.txt,1_02.txt,1_03.txt,1_04.txt,1_05.txt,1_06.txt,1_07.txt,1_08.txt,1_09.txt,1_10.txt,1_11.txt,1_12.txt,1_13.txt,1_14.txt,1_15.txt,1_16.txt,1_17.txt,1_18.txt,1_19.txt,1_20.txt,1_21.txt,1_22.txt,1_23.txt,1_24.txt,1_25.txt,1_26.txt,1_27.txt,1_28.txt,1_29.txt,1_30.txt,1_31.txt,1_32.txt,1_33.txt,1_34.txt,1_35.txt,1_36.txt,1_37.txt,1_38.txt,1_39.txt,1_40.txt,1_41.txt,1_42.txt,1_43.txt,1_44.txt,1_45.txt,1_46.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
0_00.txt AC 3 ms 256 KB
0_01.txt AC 3 ms 256 KB
1_00.txt AC 3 ms 256 KB
1_01.txt AC 71 ms 4096 KB
1_02.txt AC 54 ms 4096 KB
1_03.txt AC 63 ms 4096 KB
1_04.txt AC 63 ms 4096 KB
1_05.txt AC 67 ms 4096 KB
1_06.txt AC 58 ms 4096 KB
1_07.txt AC 61 ms 4096 KB
1_08.txt AC 63 ms 4096 KB
1_09.txt AC 29 ms 2176 KB
1_10.txt AC 25 ms 2176 KB
1_11.txt AC 17 ms 2176 KB
1_12.txt AC 29 ms 2176 KB
1_13.txt AC 21 ms 2176 KB
1_14.txt AC 17 ms 2176 KB
1_15.txt AC 39 ms 2944 KB
1_16.txt AC 21 ms 2176 KB
1_17.txt AC 31 ms 1920 KB
1_18.txt AC 58 ms 3712 KB
1_19.txt AC 55 ms 3840 KB
1_20.txt AC 39 ms 3072 KB
1_21.txt AC 52 ms 3840 KB
1_22.txt AC 49 ms 3456 KB
1_23.txt AC 23 ms 1792 KB
1_24.txt AC 50 ms 3712 KB
1_25.txt AC 38 ms 3072 KB
1_26.txt AC 21 ms 1664 KB
1_27.txt AC 21 ms 1536 KB
1_28.txt AC 19 ms 2176 KB
1_29.txt AC 32 ms 2176 KB
1_30.txt AC 52 ms 3584 KB
1_31.txt AC 58 ms 3968 KB
1_32.txt AC 19 ms 1920 KB
1_33.txt AC 61 ms 3840 KB
1_34.txt AC 22 ms 2176 KB
1_35.txt AC 18 ms 1536 KB
1_36.txt AC 57 ms 3840 KB
1_37.txt AC 50 ms 3584 KB
1_38.txt AC 62 ms 3968 KB
1_39.txt AC 18 ms 1920 KB
1_40.txt AC 18 ms 1792 KB
1_41.txt AC 31 ms 2176 KB
1_42.txt AC 31 ms 2560 KB
1_43.txt AC 55 ms 3584 KB
1_44.txt AC 12 ms 1536 KB
1_45.txt AC 19 ms 2048 KB
1_46.txt AC 24 ms 2176 KB