oj.uz

Submission #229600

# Submission time Handle Problem Language Result Execution time Memory
229600 2020-05-05T09:29:46 Z blacktulip Treasure (info1cup19_treasure) C++17
100 / 100
 64 ms 11012 KB 
#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 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 = 200005;
const lo mod = 1000000007;
 
int n,m,k,flag,t,d[li];
int cev;
set<int> st;
string s;
 
int main(void){
	fio();
	//~ freopen("simple.txt","r",stdin);
	std::clock_t start;
    double duration;
 
    start = std::clock();
	cin>>n>>k>>s;
	for(int i=0;i<n;i++)st.insert(i);
	//~ for(int jjj=1;jjj<=min(6,(int)sqrt(n)+5);jjj++){
		int say=1;
		d[0]=1;
		auto it=st.begin();
		it++;
		for(;it!=st.end();it++){
			int i=*it;
			auto it1=it;
			//~ cout<<*it<<endl;
			
			//~ cout<<i<<endl;
			it1--;
			//~ cout<<*it1<<endl;
			int i1=*it1;
			if(s[i]==s[i1])say++;
			else say=1;
			if(s[i]==s[i1])d[i]=d[i1]+1;
			else d[i]=1;
			//~ cout<<d[i]<<endl;
			if(d[i]>=k){
				say=k;
				auto it2=it;
				it2++;
				while(say>1){say--;it--;}
				it1=it;
				//~ it--;
				//~ it--;
				it=it2;
				it++;
				say=k;
				if(it1!=st.begin())it--;
				st.erase(it1,it2);
				//~ cout<<*it<<endl;
				while(say>0){
					//~ it=st.find()
					//~ cout<<*it<<endl;
					
					d[i-k+1+say-1]=1;
					say--;
				}
				n-=k;
				i-=k;
				//~ cout<<*st.begin()<<endl;
				
				it--;
				
			}
			//~ cout<<st.size()<<endl;
			//~ cout<<s[i]<<" : ; "<<i<<endl;
		}
		
	//~ }
	//~ cout<<s;
	duration = ( std::clock() - start ) / (double) CLOCKS_PER_SEC;
	int tut=0;
	int at=0;
	for(auto it=st.begin();it!=st.end();it++){
		if(tut>=k)break;
		tut++;
		if(s[*it]==s[*st.begin()])at++;
	}
	//~ cout<<at<<" : ; "<<k<<endl;
	if(at==k){
		tut=0;
		for(auto it=st.begin();it!=st.end();it++){
			if(tut>=k)break;
			tut++;
			st.erase(it);
		}
	}
		it=st.begin();
		for(;it!=st.end();it++){
			//~ cout<<*it<<endl;
			cout<<s[*it];
		}
    //~ std::cout<<"printf: "<< duration <<'\n';
	return 0;
}

Compilation message

treasure.cpp: In function 'int main()':
treasure.cpp:37:12: warning: variable 'duration' set but not used [-Wunused-but-set-variable]
     double duration;
            ^~~~~~~~

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 6 ms 768 KB Output is correct
14 Correct 7 ms 896 KB Output is correct
15 Correct 7 ms 896 KB Output is correct
16 Correct 9 ms 1408 KB Output is correct
17 Correct 15 ms 2432 KB Output is correct
18 Correct 14 ms 2432 KB Output is correct
19 Correct 21 ms 3456 KB Output is correct
20 Correct 19 ms 3064 KB Output is correct
21 Correct 26 ms 4600 KB Output is correct
22 Correct 31 ms 5624 KB Output is correct
23 Correct 32 ms 5632 KB Output is correct
24 Correct 44 ms 8324 KB Output is correct
25 Correct 44 ms 8324 KB Output is correct
26 Correct 63 ms 11012 KB Output is correct
27 Correct 56 ms 11012 KB Output is correct
28 Correct 64 ms 11012 KB Output is correct
29 Correct 58 ms 11012 KB Output is correct
30 Correct 59 ms 10884 KB Output is correct
31 Correct 60 ms 11012 KB Output is correct
32 Correct 60 ms 11012 KB Output is correct
33 Correct 61 ms 11012 KB Output is correct
34 Correct 60 ms 10884 KB Output is correct
35 Correct 58 ms 10884 KB Output is correct