제출 #210392

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
210392		tleontest1	Tavan (COCI16_tavan)	C++14	48 / 80	6 ms	892 KiB

tavan

#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;

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=0;
				for(int j=0;j<=k;j++){
					if(carp*j>t+carp-1){ind=j;break;}
				}
				flag=1;
				ind--;
				if(ind==-1)ind=k;
				s[i]=ss[say][ind-1];
				//~ cout<<t<<endl;
				//~ cout<<ind<<endl;
				ind--;
				t-=carp*k*ind;
			}
		}
	}
	cout<<s<<endl;
	return 0;
}

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

tavan.cpp:35:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(void){
          ^

• Subtask 1: 48 / 80