# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210435 | tleontest1 | Tavan (COCI16_tavan) | C++14 | 5 ms | 504 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define int long long
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 5005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t;
int cev;
string s,ss[li];
vector<int> v;
inline int mul(int x,int y){
if(x>=t || y>=t || x*y>=t)flag=1;
return (x%t)*(y%t)%t;
}
inline int fp(int x,int y){
if(y==0)return 1;
if(y==1)return x;
int q=fp(x,y/2);
q=mul(q,q);
if(y%2==1)q=mul(q,x);
return q;
}
main(void){
fio();
cin>>n>>m>>k>>t;
cin>>s;
for(int i=1;i<=m;i++){
cin>>ss[i];
sort(ss[i].begin(),ss[i].end());
}
int say=0,carp=m;
for(int i=0;i<n;i++){
if(s[i]=='#'){
say++;
carp--;
if(carp==0){
//~ if(flag==1)t++;
s[i]=ss[say][t-1];
//~ cout<<flag<<" : : "<<t<<endl;
}
else{
int ind=-1;
for(int j=1;j<=k;j++){
flag=0;
if(fp(k,carp)*(j)>=t || flag==1){ind=j;break;}
}
flag=0;
ind--;
if(ind==-2){ind=k-1;}
s[i]=ss[say][ind];
//~ cout<<t<<endl;
//~ cout<<ind<<endl;
//~ ind--;
//~ if(flag==1)ind++;
t-=fp(k,carp)*ind;
}
}
//~ cout<<t<<endl;
}
cout<<s<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |