oj.uz

Submission #121070

# Submission time Handle Problem Language Result Execution time Memory
121070 2019-06-26T04:39:25 Z _7_7_ Lottery (CEOI18_lot) C++14
45 / 100
 1422 ms 31864 KB 
#include <bits/stdc++.h>                                           

#define int long long	
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")

#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);                                          
#define forev(i, b, a) for(int i = (b); i >= (a); --i)	    
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define sz(s) (int)s.size()
#define all(x) x.bg, x.en                                                                    
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define rbg rbegin()
#define bg begin()
#define en end()
#define s second
#define f first                                               
	
   
using namespace std;                  
   
   
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb; 
typedef long long ll;  
typedef double db;                            
						               
				
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 265;	
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);  
const int inf = 1e9, N = 2e3 + 11, mod = 1e9 + 7;
const db eps = 1e-12, pi = 3.14159265359; 
const ll INF = 1e18;	



int n, l, q, cnt[N][N], a[N], k;


main () {
	ios_base :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> l;
	forn (i, 1, n)
		cin >> a[i];
	cin >> q;
	forn (i, 1, n - l + 1) 
		forn (j, i + 1, n - l + 1)
			forn (pos, 0, l - 1)
				if (a[i + pos] != a[j + pos]) {
					++cnt[i][j];
					++cnt[j][i];
				}

	while (q--) {
		cin >> k;
		forn (i, 1, n - l + 1) {
		    int res = 0;
			forn (j, 1, n - l + 1)
				if (i != j && cnt[i][j] <= k) 
					++res;
			cout << res << ' ';
		}
		cout << endl;     
	}				
	
	return 0;
}

Compilation message

lot.cpp:47:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

Subtask #1
25.0 / 25.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 7 ms 1152 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 7 ms 2048 KB Output is correct
11 Correct 7 ms 2176 KB Output is correct
12 Correct 7 ms 2048 KB Output is correct
13 Correct 96 ms 31864 KB Output is correct
14 Correct 1412 ms 19684 KB Output is correct
15 Correct 1422 ms 19804 KB Output is correct
16 Correct 910 ms 28592 KB Output is correct
17 Correct 1153 ms 26624 KB Output is correct
18 Correct 1125 ms 26792 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 29 ms 14604 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 29 ms 14604 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 7 ms 1152 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 7 ms 2048 KB Output is correct
11 Correct 7 ms 2176 KB Output is correct
12 Correct 7 ms 2048 KB Output is correct
13 Correct 96 ms 31864 KB Output is correct
14 Correct 1412 ms 19684 KB Output is correct
15 Correct 1422 ms 19804 KB Output is correct
16 Correct 910 ms 28592 KB Output is correct
17 Correct 1153 ms 26624 KB Output is correct
18 Correct 1125 ms 26792 KB Output is correct
19 Runtime error 29 ms 14604 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Halted 0 ms 0 KB -