Submission #46431084


Source Code Expand

/*
Author : Hocky Yudhiono
Sel 10 Okt 2023 05:21:54
*/

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

typedef long long ll;
typedef long long LL;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> PII;
typedef pair<int, int> pii;
typedef pair<ll, ll> PLL;
typedef pair<ll, ll> pll;
typedef long double ld;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define popf pop_front
#define pf push_front
#define popb pop_back
#define pb push_back
#define fi first
#define se second

const double EPS = 1e-9;
const int INFMEM = 63;

// Do dir^1 to get reverse direction
const int dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const int dy[8] = {1, -1, 0, 0, 1, -1, -1, 1};
const char dch[4] = {'R', 'L', 'D', 'U'};

// Do (dir + 2)%4 to get reverse direction
// const int dx[8] = {-1,0,1,0,-1,1,1,-1};
// const int dy[8] = {0,1,0,-1,1,1,-1,-1};
// const char dch[4] = {'U','R','D','L'};
const double PI = 3.141592653589793;

inline void fasterios() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
}
#define endl '\n'
const int MOD = 1000000007;
// const int MOD = 998244353;
LL isi[200005];
int main() {
  memset(isi,63,sizeof(isi));
  fasterios();
  LL n, k; cin >> n >> k;
  for (int i = 1; i <= k; i++) {
    LL x; cin >> x;
    isi[x] = x;
  }
  for(int i = n - 1;i >= 1;i--){
    isi[i] = min(isi[i + 1], isi[i]);
  }
  for(int i = 1;i <= n;i++) cout << isi[i] - i << endl;
}

Submission Info

Submission Time
Task C - Festival
User hocky
Language C++ 20 (gcc 12.2)
Score 250
Code Size 1618 Byte
Status AC
Exec Time 16 ms
Memory 5116 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 250 / 250
Status
AC × 2
AC × 29
Set Name Test Cases
Sample example_00.txt, example_01.txt
All example_00.txt, example_01.txt, test_00.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt
Case Name Status Exec Time Memory
example_00.txt AC 2 ms 5052 KiB
example_01.txt AC 2 ms 5108 KiB
test_00.txt AC 6 ms 4944 KiB
test_01.txt AC 9 ms 4976 KiB
test_02.txt AC 3 ms 4904 KiB
test_03.txt AC 3 ms 4912 KiB
test_04.txt AC 10 ms 4968 KiB
test_05.txt AC 3 ms 5020 KiB
test_06.txt AC 4 ms 5032 KiB
test_07.txt AC 4 ms 4916 KiB
test_08.txt AC 10 ms 4888 KiB
test_09.txt AC 8 ms 5116 KiB
test_10.txt AC 14 ms 4936 KiB
test_11.txt AC 13 ms 4908 KiB
test_12.txt AC 14 ms 4868 KiB
test_13.txt AC 13 ms 4972 KiB
test_14.txt AC 9 ms 4984 KiB
test_15.txt AC 15 ms 4912 KiB
test_16.txt AC 11 ms 4912 KiB
test_17.txt AC 9 ms 4988 KiB
test_18.txt AC 13 ms 4968 KiB
test_19.txt AC 11 ms 4916 KiB
test_20.txt AC 9 ms 5112 KiB
test_21.txt AC 9 ms 4940 KiB
test_22.txt AC 9 ms 4992 KiB
test_23.txt AC 9 ms 5052 KiB
test_24.txt AC 9 ms 5024 KiB
test_25.txt AC 2 ms 4944 KiB
test_26.txt AC 16 ms 4964 KiB