提出 #36670069
ソースコード 拡げる
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5;
int N, L, A[MAXN+10];
int main()
{
scanf("%d%d", &N, &L);
for(int i=1; i<=N; i++) scanf("%d", &A[i]);
int B=L, C=0;
for(int i=1; i<=N; i++)
{
B-=A[i]+1; C++;
if(B<=1)
{
for(i++; i<=N; i++)
{
if(A[i]==2) return !printf("No\n");
}
break;
}
}
printf("Yes\n");
}
提出情報
| 提出日時 | |
|---|---|
| 問題 | A - Seat Occupation |
| ユーザ | arnold518 |
| 言語 | C++ (GCC 9.2.1) |
| 得点 | 400 |
| コード長 | 468 Byte |
| 結果 | AC |
| 実行時間 | 28 ms |
| メモリ | 4404 KiB |
コンパイルエラー
./Main.cpp: In function ‘int main()’:
./Main.cpp:14:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
14 | scanf("%d%d", &N, &L);
| ~~~~~^~~~~~~~~~~~~~~~
./Main.cpp:15:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
15 | for(int i=1; i<=N; i++) scanf("%d", &A[i]);
| ~~~~~^~~~~~~~~~~~~
ジャッジ結果
| セット名 | Sample | All | ||||
|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 400 / 400 | ||||
| 結果 |
|
|
| セット名 | テストケース |
|---|---|
| Sample | sample1.txt, sample2.txt |
| All | in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in4.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| in1.txt | AC | 28 ms | 4324 KiB |
| in10.txt | AC | 2 ms | 3572 KiB |
| in11.txt | AC | 2 ms | 3628 KiB |
| in12.txt | AC | 18 ms | 3968 KiB |
| in13.txt | AC | 13 ms | 3796 KiB |
| in14.txt | AC | 12 ms | 3644 KiB |
| in15.txt | AC | 11 ms | 3868 KiB |
| in16.txt | AC | 14 ms | 4020 KiB |
| in17.txt | AC | 4 ms | 3552 KiB |
| in18.txt | AC | 3 ms | 3520 KiB |
| in19.txt | AC | 5 ms | 3488 KiB |
| in2.txt | AC | 26 ms | 4404 KiB |
| in20.txt | AC | 24 ms | 4224 KiB |
| in21.txt | AC | 21 ms | 4380 KiB |
| in22.txt | AC | 15 ms | 4104 KiB |
| in23.txt | AC | 18 ms | 4284 KiB |
| in24.txt | AC | 19 ms | 4312 KiB |
| in25.txt | AC | 15 ms | 4032 KiB |
| in26.txt | AC | 13 ms | 3948 KiB |
| in27.txt | AC | 16 ms | 4312 KiB |
| in28.txt | AC | 21 ms | 4328 KiB |
| in29.txt | AC | 16 ms | 4108 KiB |
| in3.txt | AC | 25 ms | 4328 KiB |
| in30.txt | AC | 17 ms | 4136 KiB |
| in31.txt | AC | 18 ms | 4356 KiB |
| in32.txt | AC | 19 ms | 4148 KiB |
| in33.txt | AC | 15 ms | 4008 KiB |
| in34.txt | AC | 14 ms | 4076 KiB |
| in35.txt | AC | 16 ms | 4188 KiB |
| in36.txt | AC | 5 ms | 3616 KiB |
| in37.txt | AC | 3 ms | 3640 KiB |
| in38.txt | AC | 2 ms | 3536 KiB |
| in39.txt | AC | 4 ms | 3636 KiB |
| in4.txt | AC | 20 ms | 4336 KiB |
| in40.txt | AC | 3 ms | 3640 KiB |
| in41.txt | AC | 2 ms | 3616 KiB |
| in42.txt | AC | 3 ms | 3540 KiB |
| in43.txt | AC | 2 ms | 3640 KiB |
| in44.txt | AC | 3 ms | 3552 KiB |
| in45.txt | AC | 2 ms | 3652 KiB |
| in5.txt | AC | 18 ms | 4332 KiB |
| in6.txt | AC | 20 ms | 4292 KiB |
| in7.txt | AC | 2 ms | 3448 KiB |
| in8.txt | AC | 2 ms | 3508 KiB |
| in9.txt | AC | 2 ms | 3572 KiB |
| sample1.txt | AC | 2 ms | 3512 KiB |
| sample2.txt | AC | 3 ms | 3556 KiB |