oj.uz

Submission #122158

# Submission time Handle Problem Language Result Execution time Memory
122158 2019-06-27T18:00:30 Z popovicirobert Take-out (POI13_usu) C++14
100 / 100
 162 ms 39928 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lsb(x) (x & (-x)) 

using namespace std;

const int MAXN = (int) 1e6;

char str[MAXN + 1];
int sp[MAXN + 1], pos[MAXN + 1];

int main() {
	//ifstream cin("A.in");
	//ofstream cout("A.out");
	int i, n, k;
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	
	cin >> n >> k >> (str + 1);		

	vector < vector <int> > sol(n / (k + 1) + 1);
	int sz = 0, cur = 0;
	for(i = 1; i <= n; i++) {
		sz++;
		sp[sz] = sp[sz - 1] + (str[i] == 'c');
		pos[sz] = i;
		if(sz >= k + 1 && sp[sz] - sp[sz - k - 1] == 1) {
			cur++;
			for(int j = k; j >= 0; j--) {
				sol[cur].push_back(pos[sz - j]);
			}
			sz -= (k + 1);
		}
	}

	for(i = n / (k + 1); i >= 1; i--) {
		for(auto it : sol[i]) {
			cout << it << " ";
		}
		cout << "\n";
	}
	
	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2992 KB Output is correct
2 Correct 10 ms 2072 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 4472 KB Output is correct
2 Correct 25 ms 4992 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 8824 KB Output is correct
2 Correct 46 ms 5524 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 12200 KB Output is correct
2 Correct 69 ms 11840 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 39928 KB Output is correct
2 Correct 96 ms 20960 KB Output is correct
3 Correct 89 ms 17400 KB Output is correct
4 Correct 94 ms 16376 KB Output is correct