提出 #908646
ソースコード 拡げる
#include <bits/stdc++.h>
using namespace std;
int vis[10000]={0};
int isfull[10000]={0};
int lowbit(int a)
{
return a&-a;
}
int main() {
int n,k;
char tmp[15];
cin>>n>>k;
int tol=1;
getchar();
while(n--)
{
bool f=0;
scanf("%s",tmp);
//cout<<tmp<<endl;
for(int i=1;i<=tol;i++)
{
if((vis[i]>>(tmp[0]-'A'))%2==0&&isfull[i]<k)
{
vis[i]+=(1<<(tmp[0]-'A'));
//cout<<vis[i]<<endl;
isfull[i]++;
f=1;
break;
}
}
if(f==0)
{
tol++;
vis[tol]+=1<<(tmp[0]-'A');
isfull[tol]++;
}
}
int ans=0;
for(int i=1;i<=tol;i++)
{
if(isfull[i]==k)ans++;
}
//for(int i=1;i<=tol;i++)cout<<vis[i]<<" ";cout<<endl;
cout<<ans<<endl;
//cout<<tol<<endl;
return 0;
}
提出情報
コンパイルエラー
./Main.cpp: In function ‘int main()’:
./Main.cpp:18:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s",tmp);
^
ジャッジ結果
| セット名 | All | ||||
|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 100 | ||||
| 結果 |
|
| セット名 | テストケース |
|---|---|
| All | 00_sample.txt, 01_sample.txt, corner_case_20.txt, corner_case_21.txt, corner_case_22.txt, corner_case_23.txt, corner_case_24.txt, corner_case_25.txt, corner_case_26.txt, corner_case_27.txt, corner_case_28.txt, corner_case_29.txt, random_case_00.txt, random_case_01.txt, random_case_02.txt, random_case_03.txt, random_case_04.txt, random_case_05.txt, random_case_06.txt, random_case_07.txt, random_case_08.txt, random_case_09.txt, random_case_10.txt, random_case_11.txt, random_case_12.txt, random_case_13.txt, random_case_14.txt, random_case_15.txt, random_case_16.txt, random_case_17.txt, random_case_18.txt, random_case_19.txt |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| 00_sample.txt | AC | 3 ms | 256 KiB |
| 01_sample.txt | AC | 3 ms | 256 KiB |
| corner_case_20.txt | AC | 3 ms | 256 KiB |
| corner_case_21.txt | AC | 3 ms | 256 KiB |
| corner_case_22.txt | AC | 2 ms | 256 KiB |
| corner_case_23.txt | AC | 2 ms | 256 KiB |
| corner_case_24.txt | AC | 36 ms | 256 KiB |
| corner_case_25.txt | WA | 36 ms | 256 KiB |
| corner_case_26.txt | AC | 36 ms | 256 KiB |
| corner_case_27.txt | AC | 36 ms | 256 KiB |
| corner_case_28.txt | AC | 31 ms | 256 KiB |
| corner_case_29.txt | AC | 31 ms | 256 KiB |
| random_case_00.txt | WA | 7 ms | 256 KiB |
| random_case_01.txt | WA | 9 ms | 256 KiB |
| random_case_02.txt | AC | 67 ms | 256 KiB |
| random_case_03.txt | WA | 6 ms | 256 KiB |
| random_case_04.txt | AC | 22 ms | 256 KiB |
| random_case_05.txt | WA | 21 ms | 256 KiB |
| random_case_06.txt | WA | 20 ms | 256 KiB |
| random_case_07.txt | AC | 20 ms | 256 KiB |
| random_case_08.txt | WA | 13 ms | 256 KiB |
| random_case_09.txt | WA | 20 ms | 256 KiB |
| random_case_10.txt | AC | 17 ms | 256 KiB |
| random_case_11.txt | WA | 15 ms | 256 KiB |
| random_case_12.txt | AC | 29 ms | 256 KiB |
| random_case_13.txt | WA | 9 ms | 256 KiB |
| random_case_14.txt | WA | 10 ms | 256 KiB |
| random_case_15.txt | WA | 10 ms | 256 KiB |
| random_case_16.txt | WA | 6 ms | 256 KiB |
| random_case_17.txt | WA | 9 ms | 256 KiB |
| random_case_18.txt | WA | 16 ms | 256 KiB |
| random_case_19.txt | WA | 7 ms | 256 KiB |