oj.uz

Submission #262391

# Submission time Handle Problem Language Result Execution time Memory
262391 2020-08-12T19:48:08 Z rqi Lottery (CEOI18_lot) C++14
100 / 100
 849 ms 8568 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
constexpr int pct(int x) { return __builtin_popcount(x); } 
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll half(ll x) { return fdiv(x,2); }

template<class T, class U> T fstTrue(T lo, T hi, U f) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        T mid = half(lo+hi);
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}
template<class T, class U> T lstTrue(T lo, T hi, U f) {
    lo --; assert(lo <= hi); // assuming f is decreasing
    while (lo < hi) { // find first index such that f is true 
        T mid = half(lo+hi+1);
        f(mid) ? lo = mid : hi = mid-1;
    } 
    return lo;
}
template<class T> void remDup(vector<T>& v) { 
    sort(all(v)); v.erase(unique(all(v)),end(v)); }

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
    #ifdef LOCAL
        return b ? "true" : "false"; 
    #else 
        return ts((int)b);
    #endif
}
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    #ifdef LOCAL
        bool fst = 1; str res = "{";
        for (const auto& x: v) {
            if (!fst) res += ", ";
            fst = 0; res += ts(x);
        }
        res += "}"; return res;
    #else
        bool fst = 1; str res = "";
        for (const auto& x: v) {
            if (!fst) res += " ";
            fst = 0; res += ts(x);
        }
        return res;

    #endif
}
template<class A, class B> str ts(pair<A,B> p) {
    #ifdef LOCAL
        return "("+ts(p.f)+", "+ts(p.s)+")"; 
    #else
        return ts(p.f)+" "+ts(p.s);
    #endif
}

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
    #define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
    #define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
         << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
    #define dbg(...) 0
    #define chk(...) 0
#endif

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(str s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

const int mx = 10005;
int a[mx];
int k[105];
int ans[mx][105];
int ind[mx]; //index of ans[i] a dist belongs to

int main() {
    setIO();
    int n, l;
    cin >> n >> l;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }

    int q;
    cin >> q;
    vi qs;
    for(int i = 1; i <= q; i++){
        cin >> k[i];
        k[i] = l-k[i];
        qs.pb(k[i]);
    }
    qs.pb(0);
    sort(all(qs));
    remDup(qs);
    int cnt = 0;
    for(auto u: qs){
        ind[u] = ++cnt;
    }

    for(int i = 1; i <= n; i++){
        if(ind[i] == 0) ind[i] = ind[i-1];
    }

    for(int i = 1; i <= n; i++){ //offset --> j, j+i
        if(1+i+l-1 > n) continue; //too far right
        int cur = 0;
        for(int j = 1; j <= l; j++){
            if(a[j] == a[j+i]) cur++;
        }
        ans[1][ind[cur]]++;
        ans[1+i][ind[cur]]++;
        for(int j = 2; j+i+l-1 <= n; j++){
            if(a[j-1] == a[j-1+i]) cur--;
            if(a[j+l-1] == a[j+i+l-1]) cur++;
            ans[j][ind[cur]]++;
            ans[j+i][ind[cur]]++;
        }
    }

    for(int i = cnt; i >= 1; i--){
        for(int j = 1; j <= n; j++){
            ans[j][i]+=ans[j][i+1];
        }
    }

    for(int i = 1; i <= q; i++){
        for(int j = 1; j+l-1 <= n; j++){
            cout << ans[j][ind[k[i]]] << " ";
        }
        cout << "\n";
    }
    // for(int i = 1; i <= q; i++){
    //     for(int j = 1; j+l-1 <= n; j++){
    //         cout << ans[j][sam[i]] << " ";
    //     }
    //     cout << "\n";
    // }
    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

Compilation message

lot.cpp: In function 'void setIn(str)':
lot.cpp:165:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  165 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
lot.cpp: In function 'void setOut(str)':
lot.cpp:166:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  166 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 396 KB Output is correct
3 Correct 1 ms 400 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 400 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 396 KB Output is correct
3 Correct 1 ms 400 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 400 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 13 ms 1280 KB Output is correct
14 Correct 11 ms 1280 KB Output is correct
15 Correct 8 ms 1280 KB Output is correct
16 Correct 12 ms 1280 KB Output is correct
17 Correct 12 ms 1408 KB Output is correct
18 Correct 11 ms 1280 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 543 ms 4600 KB Output is correct
2 Correct 621 ms 4600 KB Output is correct
3 Correct 316 ms 4728 KB Output is correct
4 Correct 261 ms 4600 KB Output is correct
5 Correct 83 ms 4628 KB Output is correct
6 Correct 237 ms 4600 KB Output is correct
7 Correct 79 ms 4728 KB Output is correct
8 Correct 137 ms 4700 KB Output is correct
9 Correct 251 ms 4728 KB Output is correct
10 Correct 275 ms 4728 KB Output is correct
11 Correct 17 ms 1664 KB Output is correct
12 Correct 159 ms 4180 KB Output is correct
13 Correct 118 ms 4600 KB Output is correct
14 Correct 137 ms 4600 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 543 ms 4600 KB Output is correct
2 Correct 621 ms 4600 KB Output is correct
3 Correct 316 ms 4728 KB Output is correct
4 Correct 261 ms 4600 KB Output is correct
5 Correct 83 ms 4628 KB Output is correct
6 Correct 237 ms 4600 KB Output is correct
7 Correct 79 ms 4728 KB Output is correct
8 Correct 137 ms 4700 KB Output is correct
9 Correct 251 ms 4728 KB Output is correct
10 Correct 275 ms 4728 KB Output is correct
11 Correct 17 ms 1664 KB Output is correct
12 Correct 159 ms 4180 KB Output is correct
13 Correct 118 ms 4600 KB Output is correct
14 Correct 137 ms 4600 KB Output is correct
15 Correct 373 ms 4600 KB Output is correct
16 Correct 286 ms 4732 KB Output is correct
17 Correct 289 ms 4728 KB Output is correct
18 Correct 262 ms 4608 KB Output is correct
19 Correct 262 ms 4608 KB Output is correct
20 Correct 274 ms 4728 KB Output is correct
21 Correct 277 ms 4600 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 396 KB Output is correct
3 Correct 1 ms 400 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 400 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 13 ms 1280 KB Output is correct
14 Correct 11 ms 1280 KB Output is correct
15 Correct 8 ms 1280 KB Output is correct
16 Correct 12 ms 1280 KB Output is correct
17 Correct 12 ms 1408 KB Output is correct
18 Correct 11 ms 1280 KB Output is correct
19 Correct 543 ms 4600 KB Output is correct
20 Correct 621 ms 4600 KB Output is correct
21 Correct 316 ms 4728 KB Output is correct
22 Correct 261 ms 4600 KB Output is correct
23 Correct 83 ms 4628 KB Output is correct
24 Correct 237 ms 4600 KB Output is correct
25 Correct 79 ms 4728 KB Output is correct
26 Correct 137 ms 4700 KB Output is correct
27 Correct 251 ms 4728 KB Output is correct
28 Correct 275 ms 4728 KB Output is correct
29 Correct 17 ms 1664 KB Output is correct
30 Correct 159 ms 4180 KB Output is correct
31 Correct 118 ms 4600 KB Output is correct
32 Correct 137 ms 4600 KB Output is correct
33 Correct 373 ms 4600 KB Output is correct
34 Correct 286 ms 4732 KB Output is correct
35 Correct 289 ms 4728 KB Output is correct
36 Correct 262 ms 4608 KB Output is correct
37 Correct 262 ms 4608 KB Output is correct
38 Correct 274 ms 4728 KB Output is correct
39 Correct 277 ms 4600 KB Output is correct
40 Correct 765 ms 5368 KB Output is correct
41 Correct 22 ms 4736 KB Output is correct
42 Correct 330 ms 5368 KB Output is correct
43 Correct 271 ms 5112 KB Output is correct
44 Correct 263 ms 5112 KB Output is correct
45 Correct 849 ms 8524 KB Output is correct
46 Correct 26 ms 4984 KB Output is correct
47 Correct 358 ms 8568 KB Output is correct
48 Correct 318 ms 6776 KB Output is correct
49 Correct 326 ms 7544 KB Output is correct