Submission #5410891
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define lli long long int #define REP(i,s,l) for(lli i=s;i<l;i++) #define DEBUG 0 #define INF (1LL<<50) signed main(){ string s1,s2,s3; cin>>s1>>s2>>s3; lli a[30],b[30],c[30]; REP(i,0,s1.size()){ a[s1.at(i)-'A']++; b[s2.at(i)-'A']++; c[s3.at(i)-'A']++; } lli sMax=0; lli sMin=0; REP(i,0,26){ /*S1から最低取らなきゃいけない数はS2からMAXとっても足りない場合*/ sMin += max((lli)0,c[i]-b[i]); /*S1から最大取れる数はS1とS3の小さいほうの数*/ sMax += min(a[i],c[i]); } if(sMin <= s1.size() &&s1.size()<=sMax)cout<<"YES"<<endl; else cout<<"NO"<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 錬金術士 |
User | soto800 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 719 Byte |
Status | WA |
Exec Time | 11 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | WA | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | WA | 9 ms | 640 KB |
subtask1_02.txt | WA | 2 ms | 256 KB |
subtask1_03.txt | WA | 11 ms | 640 KB |
subtask1_04.txt | WA | 8 ms | 640 KB |
subtask1_05.txt | WA | 9 ms | 640 KB |
subtask1_06.txt | WA | 5 ms | 384 KB |
subtask1_07.txt | WA | 8 ms | 512 KB |
subtask1_08.txt | WA | 4 ms | 384 KB |
subtask1_09.txt | WA | 5 ms | 512 KB |
subtask1_10.txt | WA | 7 ms | 512 KB |
subtask1_11.txt | WA | 8 ms | 640 KB |
subtask1_12.txt | WA | 10 ms | 640 KB |
subtask1_13.txt | WA | 5 ms | 512 KB |
subtask1_14.txt | WA | 7 ms | 512 KB |
subtask1_15.txt | WA | 10 ms | 640 KB |
subtask1_16.txt | WA | 3 ms | 384 KB |
subtask1_17.txt | WA | 3 ms | 256 KB |
subtask1_18.txt | WA | 7 ms | 512 KB |
subtask1_19.txt | WA | 5 ms | 512 KB |
subtask2_01.txt | AC | 1 ms | 256 KB |
subtask2_02.txt | WA | 1 ms | 256 KB |
subtask2_03.txt | AC | 1 ms | 256 KB |
subtask2_04.txt | AC | 1 ms | 256 KB |
subtask2_05.txt | AC | 1 ms | 256 KB |
subtask2_06.txt | AC | 1 ms | 256 KB |
subtask2_07.txt | AC | 1 ms | 256 KB |
subtask2_08.txt | AC | 1 ms | 256 KB |
subtask2_09.txt | AC | 1 ms | 256 KB |
subtask2_10.txt | AC | 1 ms | 256 KB |
subtask2_11.txt | AC | 1 ms | 256 KB |
subtask2_12.txt | AC | 1 ms | 256 KB |
subtask2_13.txt | AC | 1 ms | 256 KB |
subtask2_14.txt | AC | 1 ms | 256 KB |
subtask2_15.txt | WA | 1 ms | 256 KB |
subtask2_16.txt | WA | 1 ms | 256 KB |
subtask2_17.txt | AC | 1 ms | 256 KB |
subtask2_18.txt | AC | 1 ms | 256 KB |
subtask2_19.txt | AC | 1 ms | 256 KB |