oj.uz

Submission #229576

# Submission time Handle Problem Language Result Execution time Memory
229576 2020-05-05T07:51:08 Z blacktulip Treasure (info1cup19_treasure) C++17
35 / 100
 200 ms 492 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;
string s;
 
int main(void){
	fio();
	//~ freopen("simple.txt","r",stdin);
	cin>>n>>k>>s;
	//~ for(int jjj=1;jjj<=min(6,(int)sqrt(n)+5);jjj++){
		int say=1;
		d[0]=1;
		for(int i=1;i<n;i++){
			if(s[i]==s[i-1])say++;
			else say=1;
			if(s[i]==s[i-1])d[i]=d[i-1]+1;
			else d[i]=1;
			//~ cout<<d[i]<<endl;
			if(d[i]==k){
				say=k;
				while(say>0){
					s.erase(s.begin()+i-k+1);
					d[i-k+1+say-1]=1;
					say--;
				}
				n-=k;
				i-=k;
			}
			//~ cout<<s[i]<<" : ; "<<i<<endl;
		}
		
	//~ }
	cout<<s;
	return 0;
}

Subtask #1
35.0 / 35.0

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

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 9 ms 304 KB Output is correct
13 Correct 18 ms 384 KB Output is correct
14 Correct 27 ms 384 KB Output is correct
15 Correct 27 ms 256 KB Output is correct
16 Correct 95 ms 444 KB Output is correct
17 Execution timed out 403 ms 492 KB Time limit exceeded
18 Halted 0 ms 0 KB -