oj.uz

답안 #940019

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
940019 2024-03-07T04:00:34 Z vjudge1 Lottery (CEOI18_lot) C++17
25 / 100
 3000 ms 716 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
 
bool YES(bool f){ if(f) cout << "Yes\n" ; else cout << "No\n" ; return f ; }
void YES(){YES(1);}
void NO(){YES(0);}
void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0);
#define int long long
#define ld long double
#define pii pair <int , int>
#define all(x) x.begin() , x.end()
#define ff first
#define ss second
#define endl '\n'
 
const int N = 2e5 + 5 ;
const int inf = 1e16 ;
const int mod = 1e9 + 8 ;
const double eps = 1e-8 ;
 
template <class T>
bool chmax( T& x , const T& y ){
  bool f = 0 ;
  if ( x < y ) x = y , f = 1 ;
  return f ;
}
template <class T>
bool chmin( T &x , const T &y ){
  bool f = 0 ;
  if ( x > y ) x = y , f = 1 ;
  return f ;
}
 
//code
 
int n , q , l ;
int a[N] ;


void solve(){
	
	cin >> n >> l ;
	for ( int i = 0 ; i < n ; i ++ ) cin >> a[i] ;
	cin >> q ;
	while ( q -- ){
		int x ; cin >> x ;
		for ( int i = 0 ; i <= n-l ; i ++ ){
			int cnt = 0 ;
			for ( int j = 0 ; j <= n-l ; j ++ ){
				if ( i == j ) continue ;
				int c = 0 ;
				for ( int k = 0 ; k < l ; k ++ ) c += ( a[i+k] != a[j+k] ) ;
				cnt += ( c <= x ) ;
				//cout << i << ' ' << j << ' ' << c << endl ;
			}
			cout << cnt << ' ' ;
		}
		cout << endl ;
	}
	
}

signed main(){
    ios ;
	int t = 1 ;
	//cin >> t ;
	while ( t -- ) solve() ;
}

Compilation message

lot.cpp: In function 'void fopn(std::string)':
lot.cpp:10:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
lot.cpp:10:72: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 46 ms 716 KB Output is correct
9 Correct 46 ms 348 KB Output is correct
10 Correct 22 ms 344 KB Output is correct
11 Correct 18 ms 348 KB Output is correct
12 Correct 43 ms 600 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 46 ms 716 KB Output is correct
9 Correct 46 ms 348 KB Output is correct
10 Correct 22 ms 344 KB Output is correct
11 Correct 18 ms 348 KB Output is correct
12 Correct 43 ms 600 KB Output is correct
13 Correct 64 ms 348 KB Output is correct
14 Execution timed out 3067 ms 476 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 592 KB Output is correct
2 Correct 459 ms 576 KB Output is correct
3 Correct 263 ms 556 KB Output is correct
4 Execution timed out 3061 ms 620 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 592 KB Output is correct
2 Correct 459 ms 576 KB Output is correct
3 Correct 263 ms 556 KB Output is correct
4 Execution timed out 3061 ms 620 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 46 ms 716 KB Output is correct
9 Correct 46 ms 348 KB Output is correct
10 Correct 22 ms 344 KB Output is correct
11 Correct 18 ms 348 KB Output is correct
12 Correct 43 ms 600 KB Output is correct
13 Correct 64 ms 348 KB Output is correct
14 Execution timed out 3067 ms 476 KB Time limit exceeded
15 Halted 0 ms 0 KB -