提出 #46071014
ソースコード 拡げる
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
const int N = 200200;
#define inf 0x3f3f3f3f
int n, m;
int a[N], ans[N], vis[N];
int main(){
// freopen("the.in", "r", stdin);
// freopen("the.out", "w", stdout);
scanf("%d %d", &n, &m);
for (int i = 1; i <= m; i ++) scanf("%d", &a[i]), vis[a[i]] = 1;
for (int i = m; i >= 1; i --) {
int j = 0;
while (true) {
ans[a[i] - j] = j;
j ++;
if (a[i] - j < 0) break;
if (vis[a[i] - j]) break;
}
}
for (int i = 1; i <= n; i ++) cout << ans[i] << '\n';
return 0;
}
提出情報
| 提出日時 | |
|---|---|
| 問題 | C - Festival |
| ユーザ | TKXZ133 |
| 言語 | C++ 20 (gcc 12.2) |
| 得点 | 250 |
| コード長 | 707 Byte |
| 結果 | AC |
| 実行時間 | 22 ms |
| メモリ | 6064 KiB |
コンパイルエラー
Main.cpp: In function ‘int main()’:
Main.cpp:17:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
17 | scanf("%d %d", &n, &m);
| ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:18:40: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
18 | for (int i = 1; i <= m; i ++) scanf("%d", &a[i]), vis[a[i]] = 1;
| ~~~~~^~~~~~~~~~~~~
ジャッジ結果
| セット名 | Sample | All | ||||
|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 250 / 250 | ||||
| 結果 |
|
|
| セット名 | テストケース |
|---|---|
| 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 |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| example_00.txt | AC | 1 ms | 3664 KiB |
| example_01.txt | AC | 1 ms | 3704 KiB |
| test_00.txt | AC | 7 ms | 4544 KiB |
| test_01.txt | AC | 12 ms | 5060 KiB |
| test_02.txt | AC | 3 ms | 3920 KiB |
| test_03.txt | AC | 3 ms | 3780 KiB |
| test_04.txt | AC | 14 ms | 5420 KiB |
| test_05.txt | AC | 2 ms | 3844 KiB |
| test_06.txt | AC | 4 ms | 4140 KiB |
| test_07.txt | AC | 4 ms | 4176 KiB |
| test_08.txt | AC | 12 ms | 5112 KiB |
| test_09.txt | AC | 9 ms | 4940 KiB |
| test_10.txt | AC | 19 ms | 5752 KiB |
| test_11.txt | AC | 18 ms | 5768 KiB |
| test_12.txt | AC | 19 ms | 5736 KiB |
| test_13.txt | AC | 18 ms | 5536 KiB |
| test_14.txt | AC | 12 ms | 5312 KiB |
| test_15.txt | AC | 20 ms | 5920 KiB |
| test_16.txt | AC | 15 ms | 5544 KiB |
| test_17.txt | AC | 11 ms | 5344 KiB |
| test_18.txt | AC | 17 ms | 5568 KiB |
| test_19.txt | AC | 15 ms | 5480 KiB |
| test_20.txt | AC | 11 ms | 4588 KiB |
| test_21.txt | AC | 10 ms | 4544 KiB |
| test_22.txt | AC | 11 ms | 4468 KiB |
| test_23.txt | AC | 11 ms | 4512 KiB |
| test_24.txt | AC | 10 ms | 4456 KiB |
| test_25.txt | AC | 1 ms | 3756 KiB |
| test_26.txt | AC | 22 ms | 6064 KiB |