oj.uz

Submission #236740

# Submission time Handle Problem Language Result Execution time Memory
236740 2020-06-03T07:37:38 Z ne4eHbKa Vođe (COCI17_vode) C++17
120 / 120
 781 ms 188792 KB 
//{ <defines>
#include <bits/stdc++.h>
using namespace std;

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")

#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)

#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _  << ' ' <<

#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back

#define sz(x) int((x).size())
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;

inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());

template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}

int md = 998244353;

inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}

int m_bpow(ll A, ll b) {
    int a = A % md;
    ll ans = 1;
    for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
        (ans *= ans) %= md;
        if(p & b)
            (ans *= a) %= md;
    }
    re ans;
}

//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 2e5 + 5;

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    int g[n]; fo(n) cin >> g[i];
    int f[n][m + 1] {};
    int s[n][m + 1] {};
    fo(n) s[i][m] = f[i][m] = !g[i];
    for(int j = m - 1; ~j; --j) {
        for(int i = 0; i < n; ++i) {
//            f[i][j] = !g[i];
//            for(int t = j + 1; t <= min(m, j + k); ++t)
//                if(f[(i + 1) % n][t] == g[i]) f[i][j] = g[i];
            int *v = s[(i + 1) % n];
            int sm = v[j + 1] - (j + k + 1 <= m ? v[j + k + 1] : 0);
            f[i][j] = g[i]
                ? !!sm
                : sm >= min(k, m - j);
            s[i][j] = s[i][j + 1] + f[i][j];
        }
    }
    fo(n) cout << f[i][1] << ' '; cout << endl;
}

int main() {
#ifdef _LOCAL
    freopen("in.txt", "r", stdin);
    int tests; cin >> tests;
    for(int test = 1; test <= tests; ++test) {
		cerr << "case #" << test << endl;
        solve();
        cerr << endl;
    }
#else
//    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    solve();
#endif
    return 0;
}

Compilation message

vode.cpp: In function 'int m_bpow(ll, ll)':
vode.cpp:50:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
     for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
                       ~~~^~~~~~~~~~~~~~~~~~~~
vode.cpp: In function 'void solve()':
vode.cpp:9:18: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
 #define fr(i, n) for(int i = 0; i < n; ++i)
                  ^
vode.cpp:10:15: note: in expansion of macro 'fr'
 #define fo(n) fr(i, n)
               ^~
vode.cpp:85:5: note: in expansion of macro 'fo'
     fo(n) cout << f[i][1] << ' '; cout << endl;
     ^~
vode.cpp:85:35: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     fo(n) cout << f[i][1] << ' '; cout << endl;
                                   ^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1024 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 896 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 768 KB Output is correct
2 Correct 5 ms 768 KB Output is correct
3 Correct 5 ms 896 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1280 KB Output is correct
2 Correct 6 ms 1408 KB Output is correct
3 Correct 6 ms 1408 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2048 KB Output is correct
2 Correct 7 ms 1792 KB Output is correct
3 Correct 7 ms 1664 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1792 KB Output is correct
2 Correct 7 ms 1920 KB Output is correct
3 Correct 5 ms 384 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 23600 KB Output is correct
2 Correct 100 ms 26592 KB Output is correct
3 Correct 696 ms 172028 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 56192 KB Output is correct
2 Correct 616 ms 153720 KB Output is correct
3 Correct 218 ms 59520 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 781 ms 188792 KB Output is correct
2 Correct 11 ms 4608 KB Output is correct
3 Correct 8 ms 2816 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 754 ms 187512 KB Output is correct
2 Correct 645 ms 167032 KB Output is correct
3 Correct 690 ms 185848 KB Output is correct