oj.uz

답안 #926474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926474 2024-02-13T05:25:02 Z Mohammadamin__Sh Lottery (CEOI18_lot) C++17
45 / 100
 3000 ms 4688 KB 
//In His Name
#include <bits/stdc++.h>
#pragma GCC optimization("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
using namespace std;
#define ll long long
//#define int ll
typedef pair<int, int> pii;
#define F first
#define S second
#define pb push_back
#define bug(x) cout << "Ah shit , here we go again : " << x <<endl
#define all(x) x.begin() , x.end()
const int maxn = 1e4 + 10, MOD = 1e9 + 7;
const ll INF = 1e18;

int n , l , a[maxn] , q , dp[maxn][101];
vector<int> query , allq;

int main(){
    ios_base::sync_with_stdio(false);

    cin >> n >> l;
    for(int i = 1 ; i <= n ; i++) cin >> a[i];
    cin >> q;
    for(int i = 1 ; i <= q ; i++){
        int x;
        cin >> x;
        query.pb(x) , allq.pb(x);
    }
    sort(all(query));
    query.resize(unique(all(query)) - query.begin());
    for(int i = 1 ; i <= n-l+1 ; i++){
        for(int j = i+1 ; j <= n-l+1 ; j++){
            int w = 0;
            for(int k = 0 ; k < l ; k++) if(a[i+k] != a[j+k]) w++;
            int idx = lower_bound(all(query) , w) - query.begin() + 1 ;
            dp[i][idx]++ , dp[j][idx]++;
        }
    }
    for(int i = 1 ; i <= n-l+1 ; i++) for(int j = 1 ; j <= q ; j++) dp[i][j] += dp[i][j-1];
    for(int j = 0 ; j < q ; j++){
        int x = allq[j];
        int idx = lower_bound(all(query) , x) - query.begin() + 1 ;
        for(int i = 1 ; i <= n-l+1 ; i++) cout << dp[i][idx] << " ";
        cout << '\n';
    }
}

Compilation message

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

Subtask #1
25.0 / 25.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 23 ms 2708 KB Output is correct
14 Correct 208 ms 2696 KB Output is correct
15 Correct 231 ms 2696 KB Output is correct
16 Correct 142 ms 2704 KB Output is correct
17 Correct 164 ms 2716 KB Output is correct
18 Correct 181 ms 2692 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 519 ms 4440 KB Output is correct
2 Correct 741 ms 4444 KB Output is correct
3 Correct 406 ms 4688 KB Output is correct
4 Execution timed out 3033 ms 4440 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 519 ms 4440 KB Output is correct
2 Correct 741 ms 4444 KB Output is correct
3 Correct 406 ms 4688 KB Output is correct
4 Execution timed out 3033 ms 4440 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 23 ms 2708 KB Output is correct
14 Correct 208 ms 2696 KB Output is correct
15 Correct 231 ms 2696 KB Output is correct
16 Correct 142 ms 2704 KB Output is correct
17 Correct 164 ms 2716 KB Output is correct
18 Correct 181 ms 2692 KB Output is correct
19 Correct 519 ms 4440 KB Output is correct
20 Correct 741 ms 4444 KB Output is correct
21 Correct 406 ms 4688 KB Output is correct
22 Execution timed out 3033 ms 4440 KB Time limit exceeded
23 Halted 0 ms 0 KB -