Submission #3218909
Source Code Expand
#include <iostream> #include <string> using namespace std; int main(){ string sd; cin>>sd; string t; cin>>t; size_t n=sd.size(); size_t m=t.size(); string s; bool isCan; for(int i=n-m;i>=0;--i){ s=sd; for(int j=0;j<m;++j){ isCan = true; if(sd[i+j]=='?' or t[j]==sd[i+j]){ s[i+j] = t[j]; }else{ isCan=false; break; } } if(isCan) break; } if(isCan){ for(auto& i : s){ if(i=='?') i='a'; } cout<< s << endl; }else{ cout<<"UNRESTORABLE"<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Dubious Document 2 |
User | liqargon |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 557 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in01.txt | AC | 1 ms | 256 KB |
in02.txt | AC | 1 ms | 256 KB |
in03.txt | AC | 1 ms | 256 KB |
in04.txt | AC | 1 ms | 256 KB |
in05.txt | AC | 1 ms | 256 KB |
in06.txt | AC | 1 ms | 256 KB |
in07.txt | AC | 1 ms | 256 KB |
in08.txt | AC | 1 ms | 256 KB |
in09.txt | AC | 1 ms | 256 KB |
in10.txt | AC | 1 ms | 256 KB |
in11.txt | AC | 1 ms | 256 KB |
in12.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |