oj.uz

답안 #824976

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824976 2023-08-14T12:44:29 Z Sam_a17 Lottery (CEOI18_lot) C++17
100 / 100
 1022 ms 12396 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 1e4 + 10;
int n, l, q, a[N];
int dp[N][105], pat[N][105];
int pref[N];

void solve_() {
  cin >> n >> l;

  for(int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  
  cin >> q;
  vector<pair<int, int>> qq;
  for(int i = 0; i < q; i++) {
    int kk; cin >> kk;
    qq.push_back({kk, i});
  }

  sort(all(qq));

  int m = n - l + 1;
  for(int i = 1; i < n; i++) {
    for(int j = 1; j + i <= n; j++) {
      if(a[j] != a[j + i]) {
        pref[j] = pref[j - 1] + 1;
      } else {
        pref[j] = pref[j - 1];
      }
    }

    for(int j = 1; j + i + l - 1 <= n; j++) {
      int s = pref[j + l - 1] - pref[j - 1];
      auto it = lower_bound(all(qq), make_pair(s, -1));
      if(it != qq.end()) {
        pat[j][it - qq.begin()]++;
        pat[i + j][it - qq.begin()]++;
      }
    }
  }
  
  for(int i = 1; i <= n; i++) {
    for(int j = 1; j < q; j++) {
      pat[i][j] += pat[i][j - 1];
    }
  }

  vector<vector<int>> pt(q + 1);
  int it = 0;
  for(auto i: qq) {
    vector<int> pi;
    for(int j = 1; j <= m; j++) {
      pi.push_back(pat[j][it]);
    }
    pt[i.second] = pi;
    it++;
  }

  for(int i = 0; i < q; i++) {
    for(auto j: pt[i]) {
      cout << j << " ";
    }
    cout << '\n';
  }
}
 
int main() {
  fastIO();
 
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

lot.cpp: In function 'void setIO(std::string)':
lot.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
lot.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 18 ms 1168 KB Output is correct
14 Correct 12 ms 1284 KB Output is correct
15 Correct 9 ms 1292 KB Output is correct
16 Correct 14 ms 1364 KB Output is correct
17 Correct 14 ms 1392 KB Output is correct
18 Correct 13 ms 1364 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 394 ms 4624 KB Output is correct
2 Correct 360 ms 4624 KB Output is correct
3 Correct 218 ms 4628 KB Output is correct
4 Correct 221 ms 3828 KB Output is correct
5 Correct 140 ms 424 KB Output is correct
6 Correct 205 ms 1216 KB Output is correct
7 Correct 149 ms 2436 KB Output is correct
8 Correct 198 ms 3276 KB Output is correct
9 Correct 217 ms 4224 KB Output is correct
10 Correct 222 ms 4428 KB Output is correct
11 Correct 15 ms 724 KB Output is correct
12 Correct 145 ms 1276 KB Output is correct
13 Correct 155 ms 404 KB Output is correct
14 Correct 159 ms 392 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 394 ms 4624 KB Output is correct
2 Correct 360 ms 4624 KB Output is correct
3 Correct 218 ms 4628 KB Output is correct
4 Correct 221 ms 3828 KB Output is correct
5 Correct 140 ms 424 KB Output is correct
6 Correct 205 ms 1216 KB Output is correct
7 Correct 149 ms 2436 KB Output is correct
8 Correct 198 ms 3276 KB Output is correct
9 Correct 217 ms 4224 KB Output is correct
10 Correct 222 ms 4428 KB Output is correct
11 Correct 15 ms 724 KB Output is correct
12 Correct 145 ms 1276 KB Output is correct
13 Correct 155 ms 404 KB Output is correct
14 Correct 159 ms 392 KB Output is correct
15 Correct 278 ms 4488 KB Output is correct
16 Correct 202 ms 2248 KB Output is correct
17 Correct 227 ms 4300 KB Output is correct
18 Correct 218 ms 2356 KB Output is correct
19 Correct 220 ms 2556 KB Output is correct
20 Correct 231 ms 4676 KB Output is correct
21 Correct 216 ms 4428 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 18 ms 1168 KB Output is correct
14 Correct 12 ms 1284 KB Output is correct
15 Correct 9 ms 1292 KB Output is correct
16 Correct 14 ms 1364 KB Output is correct
17 Correct 14 ms 1392 KB Output is correct
18 Correct 13 ms 1364 KB Output is correct
19 Correct 394 ms 4624 KB Output is correct
20 Correct 360 ms 4624 KB Output is correct
21 Correct 218 ms 4628 KB Output is correct
22 Correct 221 ms 3828 KB Output is correct
23 Correct 140 ms 424 KB Output is correct
24 Correct 205 ms 1216 KB Output is correct
25 Correct 149 ms 2436 KB Output is correct
26 Correct 198 ms 3276 KB Output is correct
27 Correct 217 ms 4224 KB Output is correct
28 Correct 222 ms 4428 KB Output is correct
29 Correct 15 ms 724 KB Output is correct
30 Correct 145 ms 1276 KB Output is correct
31 Correct 155 ms 404 KB Output is correct
32 Correct 159 ms 392 KB Output is correct
33 Correct 278 ms 4488 KB Output is correct
34 Correct 202 ms 2248 KB Output is correct
35 Correct 227 ms 4300 KB Output is correct
36 Correct 218 ms 2356 KB Output is correct
37 Correct 220 ms 2556 KB Output is correct
38 Correct 231 ms 4676 KB Output is correct
39 Correct 216 ms 4428 KB Output is correct
40 Correct 684 ms 6136 KB Output is correct
41 Correct 128 ms 4740 KB Output is correct
42 Correct 327 ms 6144 KB Output is correct
43 Correct 305 ms 5832 KB Output is correct
44 Correct 299 ms 5820 KB Output is correct
45 Correct 1022 ms 12288 KB Output is correct
46 Correct 134 ms 5196 KB Output is correct
47 Correct 575 ms 12396 KB Output is correct
48 Correct 412 ms 10396 KB Output is correct
49 Correct 423 ms 11120 KB Output is correct