oj.uz

답안 #121055

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
121055 2019-06-26T04:16:20 Z RockyB Lottery (CEOI18_lot) C++17
45 / 100
 362 ms 16064 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)2000 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, l;
int a[N];

int diff(int x, int y) {
	int cnt = 0;
	rep(i, 0, l - 1) cnt += a[x + i] != a[y + i];
	return cnt;
}

int cnt[N][N];
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> l;
	rep(i, 1, n) cin >> a[i];

	rep(i, 1, n - l + 1) {
		rep(j, 1, n - l + 1) {
			cnt[i][diff(i, j)]++;
		}
		rep(j, 1, n) cnt[i][j] += cnt[i][j - 1];
	}

	int q;
	cin >> q;
	while (q--) {
		int k;
		cin >> k;
		rep(i, 1, n - l + 1) {
			cout << cnt[i][k] - 1 << ' ';
		}
		cout << nl;
	}
	ioi
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 4 ms 1152 KB Output is correct
9 Correct 4 ms 1152 KB Output is correct
10 Correct 4 ms 1792 KB Output is correct
11 Correct 4 ms 1792 KB Output is correct
12 Correct 5 ms 1664 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 4 ms 1152 KB Output is correct
9 Correct 4 ms 1152 KB Output is correct
10 Correct 4 ms 1792 KB Output is correct
11 Correct 4 ms 1792 KB Output is correct
12 Correct 5 ms 1664 KB Output is correct
13 Correct 41 ms 16064 KB Output is correct
14 Correct 362 ms 10956 KB Output is correct
15 Correct 326 ms 10972 KB Output is correct
16 Correct 243 ms 14472 KB Output is correct
17 Correct 282 ms 13496 KB Output is correct
18 Correct 284 ms 13660 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 4 ms 1152 KB Output is correct
9 Correct 4 ms 1152 KB Output is correct
10 Correct 4 ms 1792 KB Output is correct
11 Correct 4 ms 1792 KB Output is correct
12 Correct 5 ms 1664 KB Output is correct
13 Correct 41 ms 16064 KB Output is correct
14 Correct 362 ms 10956 KB Output is correct
15 Correct 326 ms 10972 KB Output is correct
16 Correct 243 ms 14472 KB Output is correct
17 Correct 282 ms 13496 KB Output is correct
18 Correct 284 ms 13660 KB Output is correct
19 Incorrect 2 ms 384 KB Output isn't correct
20 Halted 0 ms 0 KB -