QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #126917 | #2370. Keyboardd | KKT89 | AC ✓ | 1ms | 3544kb | C++14 | 3.5kb | 2023-07-19 09:53:14 | 2023-07-19 09:53:17 |
Judging History
answer
#pragma region templates
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template<typename T> using V = vector<T>;
template<typename T> using VV = vector<vector<T>>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using PQR = priority_queue<T,vector<T>,greater<T>>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define all(v) (v).begin(),(v).end()
#define siz(v) (ll)(v).size()
#define rep(i,a,n) for(ll i=a;i<(ll)(n);++i)
#define repr(i,a,n) for(ll i=n-1;(ll)a<=i;--i)
#define ENDL '\n'
typedef pair<int,int> Pi;
typedef pair<ll,ll> PL;
constexpr ll mod = 1000000007; // 998244353;
constexpr ll INF = 1000000099;
constexpr ll LINF = (ll)(1e18 +99);
const ld PI = acos((ld)-1);
constexpr ll dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
template<typename T,typename U> inline bool chmin(T& t, const U& u){if(t>u){t=u;return 1;}return 0;}
template<typename T,typename U> inline bool chmax(T& t, const U& u){if(t<u){t=u;return 1;}return 0;}
template<typename T> inline T gcd(T a,T b){return b?gcd(b,a%b):a;}
inline void Yes() { cout << "Yes" << ENDL; }
inline void No() { cout << "No" << ENDL; }
inline void YES() { cout << "YES" << ENDL; }
inline void NO() { cout << "NO" << ENDL; }
template<typename T,typename Y> inline T mpow(T a, Y n) {
T res = 1;
for(;n;n>>=1) {
if (n & 1) res = res * a;
a = a * a;
}
return res;
}
template <typename T>
vector<T> finddivisor(T x) { //整数xの約数(xを含む)
vector<T> divisor;
for(T i = 1; (i * i) <= x; i++) {
if(x % i == 0) {
divisor.push_back(i);
if(i * i != x) { divisor.push_back(x / i);}
}
}
sort(divisor.begin(), divisor.end());
return divisor;
}
template <typename T> V<T> prefix_sum(const V<T>& v) {
int n = v.size();
V<T> ret(n + 1);
rep(i, 0, n) ret[i + 1] = ret[i] + v[i];
return ret;
}
template <typename T> void get_unique(V<T> &v) {
sort(all(v));
v.erase(unique(all(v)), v.end());
return;
}
template<typename T>
T rand(T l,T r){
static random_device rd;
static mt19937 g(rd());
return uniform_int_distribution<T>(l,r)(g);
}//[]
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
for(auto&& x: vec) is >> x;
return is;
}
template<typename T,typename Y>
ostream& operator<<(ostream& os,const pair<T,Y>& p){
return os<<"{"<<p.fs<<","<<p.sc<<"}";
}
template<typename T> ostream& operator<<(ostream& os,const V<T>& v){
os<<"{";
for(auto e:v)os<<e<<",";
return os<<"}";
}
template<typename ...Args>
void debug(Args&... args){
for(auto const& x:{args...}){
cerr<<x<<' ';
}
cerr<<ENDL;
}
#pragma endregion templates
signed main(){
string s,t;
getline(cin,s);
getline(cin,t);
int jd=0;
V<char> ans(0);
rep(i,0,siz(s)){
while(t[jd]!=s[i]){
ans.eb(t[jd]);
++jd;
}
if(t[jd]==s[i])++jd;
}
if(jd<siz(t))ans.eb(t[jd]);
get_unique(ans);
for(auto&& c:ans)cout<<c;
cout<<ENDL;
}
//(・_・)(・_・)(・_・)(・_・)
//CHECK overflow,what to output?
//any other simpler approach?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3532kb
input:
jjfbzeobtfcsojecfiljyrjkpnr zszc dxu t vutredmmoirnresmscxxkoypebtyludrr rvvustyrrtcigvimwuuuexscpw udcdnjrmbrynxs ndrcyulqocdstcpfdfzruunridmefxpkfnelerifxvqtvfzzgx nxupzfgzdpbupmbdpubvfsdzhpcsh iofvreluj nuzjokydslynv asxjgaqfvzs ppul mfaolqy wndwrfjgmoirgrddygrndacccdpvxgxxfrcorowospghjijeliixlp...
output:
adhjqvy
result:
ok
Test #2:
score: 0
Accepted
time: 1ms
memory: 3420kb
input:
drdnk wrllxlnppggjxylcfmhgtiwdwgesfmqiphxsdqcgasjrgezyczsoyrzqimp sbjnogk zsiolzluaubqnijkssqjawdgiyl dk vtwllwgbknecxx sqfmfzrbfmjggmtmyklfjvupeycrzeamqwyvqrfdrfglgpwmanhbaferohzptuxmtgstri zetbpzokqotzbwibypaehuleoizgykzsf vfxrrhupcneeyru msqtiud uczzqv bjcazwnxqj refvwhlneomxsklovdsekiropkdbegpv...
output:
cdfjkoqrtvwxy
result:
ok
Test #3:
score: 0
Accepted
time: 1ms
memory: 3420kb
input:
abiehgmmjsdkuxxybhcdpamngyltorc vvisarlfokhgzdimvavjifflvrfjqbkxkrxbnifykbuitmpeiskseds msuksvygoxxyegljhrtqrqqrhhtvimsxpnnnjtljmpczsgyvwiptsyhjjdljcsedyxmvhyjbuw ceegdwjqfqsnenpemeebzduifnenxjnsulwczulfmgmntndxzhpe kprisosrrmccrxnzgukuryfygsfsfuhtllxifmbhlqpiwrbrgh smiqfcvsnnyheymomtyxdxlhyspuwg ea...
output:
ceijkmnqrstx
result:
ok
Test #4:
score: 0
Accepted
time: 1ms
memory: 3500kb
input:
zggnxppcponfbhkvtpbrxaatcqo spxlvtasdprsmegvipimeczglfkcttemelrhredcqrgvzitggpolqboyyrgcsyql shtahiuozvmdjtpydnq ksb iaevfvzyvz t dxoamrumophmflcnngeixhjz stlcoyhgzeav npxcmafgc vgtsdlokggjwzlhwttrldfitouc zxnshjbgyvbkolrzubinmstjpvqsd ldxcavtk csajkljwelm agicwfhkdaljkqzl cchafejmxcekvrho ih zsikmi...
output:
abcdefghijklmnopqrstuvwxyz
result:
ok
Test #5:
score: 0
Accepted
time: 1ms
memory: 3460kb
input:
f rjkrdqzbugpvnfttclpfauxhowodpudmtngaqkeekwjndbc mbnmqvdrpyfcnnzbremddonpcaazmzhksdrfla zgjkdapoueqqbaj hy fj snzbnircipizbdcxjrhmlwll mvygpqmcbpodjuwskxohfztbm myjxpjeiptdktnopybjdazwwediwktbqwbtkzx xkdh jvioqeoawdavcfpziwpdd nez stgnhffyz widrzhyktjvvdeoowbbubpocvjxjzlexqtkaoyltq jvvzdlcgxmrozsli...
output:
abcdefghijklmnopqrstuvwxyz
result:
ok
Test #6:
score: 0
Accepted
time: 1ms
memory: 3532kb
input:
kgybhoyhgmoadiaxmn dsogkuecufua gyjlmfjdvffqhymescmhdmapwhkhbdnjdhtzxol uzwxqwaybhbhdpfm dg koe ogiifeivnnpytifaahvtqdhihsmkiifsbsqmjhijuzdzjcwqkgbkgcdgobimbuwqdjjfwgw fxnitifojhr dubnztmgxhdhbvk cqyyjymbejlhbyljxnntwaqcmoohhmxodivxwuqpfwtwqimkzwbkloumzmnyonxuczvdtiktiduwqqwimmtpjlrojdpvty yerhvjtpy...
output:
bdhstu
result:
ok
Test #7:
score: 0
Accepted
time: 0ms
memory: 3440kb
input:
pxmmttme v skpcoydzoaauhqsbtrgiayox zqfyfxqlnupqrswuqebfanwrjukoolxrutacyfjalwyregxsxbqihxbzqdhbpfquuask yxmyktvllwtylzwxqljzzwwybbcvdcbrgmaxps swhzgcoowinresw lvzyokfhwhjxatlhnqkttiisdaeyxvxnbbiumzzktdlfrnpndgisxuzrn qarvjkvesdbewedgp oclrsmrzudtlgkndnqxskxcged acpqavjwepjekjkqmwkm hsksxfxbcdiwagz...
output:
abcdefhjklopqtuvwxyz
result:
ok
Test #8:
score: 0
Accepted
time: 1ms
memory: 3544kb
input:
reotdcf cucdvvxcicdnmzvqrzvfskdlkkupbnkhzcaanvodqoevirazlmqppiciayhtxgljvxhxqftt rzkznacamqfjtjgbgotoqzfsnsoshtduneklxnbnpjl vrpxmdxiyisdqrklsciddltbzebiqaaryvhurbojouzsjfqkqsslabddponyfrmujanaucuelodfauopqnkaafdixlopgbbotphltmbbtsop wyywwcee d ghjbyhbkhemwqobjvpalwu vsfpn tuiymbxal ymmechzfjis yczl...
output:
aceghiklrtuxy
result:
ok
Test #9:
score: 0
Accepted
time: 0ms
memory: 3412kb
input:
fzdxcibocfgzinbus rvzw psmpjzrfjgfco yuydjelhfhyzuqkwbplnmofamtupztaqjrkbfqcwrg szepouresmnlrtqvjyzylacldjvnpxl phgfmig yupiosplhyx juzimxwngbrcuckwyhpfqcoiqzmnaip qqekaoqvbzjfztcliqbyjifqzwztjlppdbzfik we bgxzi o yjxwrqndhtqztsbxigpentuoekyrmbuiwqlacqvjdwxdpdhidiwuazmdhmlwtqm cevcypzaupmivuyhikndf...
output:
abchijkmpx
result:
ok
Test #10:
score: 0
Accepted
time: 1ms
memory: 3532kb
input:
tgzumnmmxxcvelnj jkgmh yqvljsnrnksyh ejkgnjkpwetpxa vsuhiusiwqvcfvswyhsoglttkvppxplveyyxopoeasosuvfut jplhivquysxaqgrusyuunnqeueqrapzjsrgutmngrif edwzpbocwtenvghers tvqnrbkpnqtjzputvvfownxdddtqlztjzkyimnkwpsdzbvhdrbx hpdzzngydhgkznpzlhlxwwsopzibppmx agomppecalhlbbzulrywzycvphgd qzfqmdpeszbcispbquw...
output:
dk
result:
ok
Test #11:
score: 0
Accepted
time: 1ms
memory: 3432kb
input:
a aa
output:
a
result:
ok
Test #12:
score: 0
Accepted
time: 1ms
memory: 3500kb
input:
aa aaaa
output:
a
result:
ok
Test #13:
score: 0
Accepted
time: 1ms
memory: 3400kb
input:
ab abb
output:
b
result:
ok
Test #14:
score: 0
Accepted
time: 1ms
memory: 3476kb
input:
xxxxyyyyzzzz xxxxyyyyyyyyzzzz
output:
y
result:
ok
Test #15:
score: 0
Accepted
time: 0ms
memory: 3460kb
input:
xxxxyyyyzzzz xxxxxxxxyyyyzzzz
output:
x
result:
ok
Test #16:
score: 0
Accepted
time: 1ms
memory: 3464kb
input:
xxxxyyyyzzzz xxxxyyyyzzzzzzzz
output:
z
result:
ok
Test #17:
score: 0
Accepted
time: 1ms
memory: 3500kb
input:
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...
output:
a
result:
ok
Test #18:
score: 0
Accepted
time: 0ms
memory: 3476kb
input:
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...
output:
b
result:
ok
Test #19:
score: 0
Accepted
time: 1ms
memory: 3472kb
input:
a b a b
output:
result:
ok
Test #20:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
a ...
output:
result:
ok