제출 #210453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
210453		Fasho	Tavan (COCI16_tavan)	C++14	80 / 80	5 ms	632 KiB

tavan

#include <bits/stdc++.h>
#define N 1000
#define ll long long int 	
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define fast2 freopen ("badhair.gir","r",stdin);freopen ("badhair.cik","w",stdout);
#define mod 1000000007
#define fs(x,y) for(ll i=1;i<=y;i++) cin>>x[i]
#define fo(i,x,y) for(ll i=x;i<=y;i++)
#define INF 1000000000005
#define ull unsigned long long int
using namespace std;

ll n,m,ar[N],sum,t,ans[N],pw[N],cnt,k,l;

char s[N],c[N][N];

int main()
{
	fast;
	cin>>n>>m>>k>>l;
	l--;
	cin>>s+1;
	fo(i,1,m)
	{
		cin>>c[i];
		sort(c[i],c[i]+k);
	}
	pw[0]=1;
	for(int i=1;i<=n;i++)
	{
		pw[i]=pw[i-1]*k;
		if(pw[i]>l)
		{
			cnt=i-1;
			break;
		}
	}
	for(int i=m;i>=1;i--)
	{
		ll x=i-1;
		if(x>cnt)
			continue;
		for(int j=0;j<k;j++)
		{
			if(l>=pw[x]*j)
				ans[m-i+1]=j;
		}	
		// cout<<l<<sp<<ans[m-i+1]<<sp<<x<<sp;
		l-=pw[x]*ans[m-i+1];
		// cout<<l<<endl;
	}
	// cout<<endl;
	int cnt=1;
	fo(i,1,n)
	{
		if(s[i]=='#')
		{
			cout<<c[cnt][ans[cnt]];
			cnt++;
		}
		else
			cout<<s[i];
	}
	// for(int i=1;i<=m;i++)
	// 	cout<<c[i][ans[i]]<<sp;


}

컴파일 시 표준 에러 (stderr) 메시지

tavan.cpp: In function 'int main()':
tavan.cpp:31:8: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  cin>>s+1;
       ~^~

• Subtask 1: 80 / 80