oj.uz

Submission #309092

# Submission time Handle Problem Language Result Execution time Memory
309092 2020-10-02T18:09:57 Z shivensinha4 Lottery (CEOI18_lot) C++17
45 / 100
 3000 ms 1272 KB 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h> 
using namespace std; 
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define endl '\n'

const int MXN = 10000, MXQ = 100;
int ans[MXQ+1][MXN+1], nums[MXN+1], match[MXN+1], freq[MXN+3], qr[MXQ+1];
vi pos[MXN+1];

int main() {
	#ifdef shiven
	freopen("test.in", "r", stdin);
	#endif
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n, l; cin >> n >> l;
	vector<ii> val(n);
	for_(i, 0, n) {
		cin >> nums[i];
		val[i] = {nums[i], i};
	}
	
	sort(val.begin(), val.end());
	int pt = -1;
	for_(i, 0, n) {
		if (i > 0 and val[i].first == val[i-1].first) nums[val[i].second] = pt;
		else nums[val[i].second] = ++pt;
	}
	
	for_(i, 0, n) pos[nums[i]].push_back(i);
	
	int q; cin >> q;
	for_(i, 0, q) cin >> qr[i];
	
	for_(i, 0, n-l+1) {
		memset(match, 0, sizeof(match)); memset(freq, 0, sizeof(freq));
		for_(j, 0, l) for (auto p: pos[nums[i+j]]) if (p >= j and p != i+j) match[p-j] += 1;
		int mx = 0;
		for_(j, 0, n-l+1) if (i != j) {
			freq[match[j]] += 1;
			mx = max(mx, match[j]);
		}
		for (int j = mx-1; j >= 0; j--) freq[j] += freq[j+1];
		for_(j, 0, q) ans[j][i] = freq[l-qr[j]];
	}
	
	for_(i, 0, q) {
		for_(j, 0, n-l+1) cout << ans[i][j] << " ";
		cout << endl;
	}
	
	cout << endl;

	return 0;
}

Compilation message

lot.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
lot.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 1 ms 640 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 3 ms 768 KB Output is correct
12 Correct 2 ms 768 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 1 ms 640 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 3 ms 768 KB Output is correct
12 Correct 2 ms 768 KB Output is correct
13 Correct 26 ms 768 KB Output is correct
14 Correct 15 ms 1024 KB Output is correct
15 Correct 60 ms 888 KB Output is correct
16 Correct 106 ms 1016 KB Output is correct
17 Correct 25 ms 1016 KB Output is correct
18 Correct 33 ms 1016 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 862 ms 1272 KB Output is correct
2 Correct 1374 ms 1144 KB Output is correct
3 Correct 448 ms 1144 KB Output is correct
4 Correct 664 ms 1024 KB Output is correct
5 Execution timed out 3067 ms 896 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 862 ms 1272 KB Output is correct
2 Correct 1374 ms 1144 KB Output is correct
3 Correct 448 ms 1144 KB Output is correct
4 Correct 664 ms 1024 KB Output is correct
5 Execution timed out 3067 ms 896 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 1 ms 640 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 3 ms 768 KB Output is correct
12 Correct 2 ms 768 KB Output is correct
13 Correct 26 ms 768 KB Output is correct
14 Correct 15 ms 1024 KB Output is correct
15 Correct 60 ms 888 KB Output is correct
16 Correct 106 ms 1016 KB Output is correct
17 Correct 25 ms 1016 KB Output is correct
18 Correct 33 ms 1016 KB Output is correct
19 Correct 862 ms 1272 KB Output is correct
20 Correct 1374 ms 1144 KB Output is correct
21 Correct 448 ms 1144 KB Output is correct
22 Correct 664 ms 1024 KB Output is correct
23 Execution timed out 3067 ms 896 KB Time limit exceeded
24 Halted 0 ms 0 KB -