提出 #69368085
ソースコード 拡げる
#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[200005];
void solve()
{
int n, r;
cin >> n >> r;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
int c = r;
for (int i = 1; i <= r; i++)
{
if (a[i] == 0)
{
c = i;
break;
}
}
int d = r;
for (int i = n; i >= r; i--)
{
if (a[i] == 0)
{
d = i;
break;
}
}
int sum1 = 0, sum2 = 0;
for (int i = r; i >= c; i--)
{
if (a[i] == 1)
sum1 += 2;
else
sum1++;
}
for (int i = r + 1; i <= d; i++)
{
if (a[i] == 1)
sum1 += 2;
else
sum1++;
}
cout <<sum1<< '\n';
}
signed main()
{
int t = 1;
// cin>>t;
while (t--)
{
solve();
}
return 0;
}
提出情報
| 提出日時 | |
|---|---|
| 問題 | C - Lock All Doors |
| ユーザ | BAZzz |
| 言語 | C++ 20 (gcc 12.2) |
| 得点 | 0 |
| コード長 | 947 Byte |
| 結果 | WA |
| 実行時間 | 21 ms |
| メモリ | 5200 KiB |
コンパイルエラー
Main.cpp: In function ‘void solve()’:
Main.cpp:31:19: warning: unused variable ‘sum2’ [-Wunused-variable]
31 | int sum1 = 0, sum2 = 0;
| ^~~~
ジャッジ結果
| セット名 | Sample | All | ||||||
|---|---|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 0 / 300 | ||||||
| 結果 |
|
|
| セット名 | テストケース |
|---|---|
| Sample | sample00.txt, sample01.txt, sample02.txt |
| All | sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| sample00.txt | AC | 1 ms | 3668 KiB |
| sample01.txt | AC | 1 ms | 3476 KiB |
| sample02.txt | AC | 1 ms | 3672 KiB |
| testcase00.txt | WA | 13 ms | 4520 KiB |
| testcase01.txt | WA | 18 ms | 5092 KiB |
| testcase02.txt | AC | 17 ms | 4812 KiB |
| testcase03.txt | AC | 19 ms | 5092 KiB |
| testcase04.txt | WA | 4 ms | 3772 KiB |
| testcase05.txt | WA | 19 ms | 4972 KiB |
| testcase06.txt | WA | 14 ms | 4644 KiB |
| testcase07.txt | WA | 18 ms | 5016 KiB |
| testcase08.txt | AC | 8 ms | 4092 KiB |
| testcase09.txt | AC | 21 ms | 5044 KiB |
| testcase10.txt | AC | 16 ms | 4716 KiB |
| testcase11.txt | AC | 21 ms | 5048 KiB |
| testcase12.txt | WA | 3 ms | 3592 KiB |
| testcase13.txt | WA | 21 ms | 5036 KiB |
| testcase14.txt | WA | 18 ms | 4888 KiB |
| testcase15.txt | WA | 21 ms | 4968 KiB |
| testcase16.txt | WA | 18 ms | 5200 KiB |
| testcase17.txt | WA | 18 ms | 5016 KiB |
| testcase18.txt | AC | 2 ms | 3508 KiB |
| testcase19.txt | AC | 21 ms | 5044 KiB |
| testcase20.txt | AC | 12 ms | 4324 KiB |
| testcase21.txt | AC | 19 ms | 5168 KiB |
| testcase22.txt | AC | 18 ms | 4884 KiB |
| testcase23.txt | AC | 19 ms | 5092 KiB |
| testcase24.txt | WA | 16 ms | 4728 KiB |
| testcase25.txt | WA | 18 ms | 5028 KiB |
| testcase26.txt | WA | 17 ms | 4980 KiB |
| testcase27.txt | WA | 20 ms | 5008 KiB |
| testcase28.txt | AC | 18 ms | 5012 KiB |
| testcase29.txt | WA | 18 ms | 5048 KiB |