oj.uz

답안 #121078

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
121078 2019-06-26T05:00:26 Z RockyB Lottery (CEOI18_lot) C++17
0 / 100
 719 ms 4396 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimization ("unroll-loops")
#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)1e4 + 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, q, l;
int a[N];

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

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

	cin >> q;	
	rep(i, 1, q) cin >> k[i];

	rep(i, 1, n - l + 1) {
		rep(j, 0, 0) cnt[j] = 0;
		rep(j, 1, n - l + 1) cnt[diff(i, j)]++;
		// rep(j, 1, l) cnt[j] += cnt[j - 1];
		rep(id, 1, q) {
			ans[i][id] = cnt[k[id]] - 1;
		}
	}
	rep(i, 1, q) {
		rep(j, 1, n - l + 1) cout << ans[j][i] << ' ';
		cout << nl;
	}
	ioi
}

Compilation message

lot.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
 
lot.cpp: In function 'int diff(int, int)':
lot.cpp:45:6: warning: unused variable 'cnt' [-Wunused-variable]
  int cnt = 0;
      ^~~

Subtask #1
0 / 25.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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