oj.uz

Submission #544238

# Submission time Handle Problem Language Result Execution time Memory
544238 2022-04-01T12:53:12 Z SmolBrain Vođe (COCI17_vode) C++17
120 / 120
 804 ms 216640 KB 
// Om Namah Shivaya
// GM in 123 days

#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;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

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

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << 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(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;

bool dp[5005][5005];
ll suff[5005][5005];

void solve(int test_case)
{
    ll n, m, k; cin >> n >> m >> k;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];

    rev(j, m - 2, 0) {
        rep(i, n) {
            ll nxt = (i + 1) % n;
            ll l = j + 1, r = min(j + k, m);
            ll len = r - l + 1;

            ll ones = suff[nxt][l] - suff[nxt][r + 1];
            ll zeros = len - ones;

            if (a[i] == a[nxt]) {
                dp[i][j] = ones > 0;
            }
            else {
                dp[i][j] = zeros > 0;
            }

            suff[i][j] = suff[i][j + 1] + dp[i][j];

            /*

            naive O(k) dp transition:

            rep1(x, k) {
                if (j + x >= m) conts;

                ll nxt = (i + 1) % n;

                if (a[i] == a[nxt]) {
                    if (dp[nxt][j + x] == 1) {
                        dp[i][j] = 1;
                    }
                }
                else {
                    if (dp[nxt][j + x] == 0) {
                        dp[i][j] = 1;
                    }
                }
            }

            */
        }
    }

    rep(i, n) {
        if (dp[i][0]) cout << a[i] << " ";
        else cout << (a[i] ^ 1) << " ";
    }

    cout << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

vode.cpp: In function 'void usaco(std::string)':
vode.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((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vode.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((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 724 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct
3 Correct 2 ms 2388 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2516 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3924 KB Output is correct
2 Correct 3 ms 4564 KB Output is correct
3 Correct 3 ms 4308 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5204 KB Output is correct
2 Correct 4 ms 5460 KB Output is correct
3 Correct 0 ms 340 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 39592 KB Output is correct
2 Correct 106 ms 42676 KB Output is correct
3 Correct 675 ms 212548 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 78444 KB Output is correct
2 Correct 621 ms 196328 KB Output is correct
3 Correct 193 ms 84264 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 780 ms 214172 KB Output is correct
2 Correct 5 ms 5332 KB Output is correct
3 Correct 3 ms 3148 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 737 ms 215568 KB Output is correct
2 Correct 525 ms 210496 KB Output is correct
3 Correct 804 ms 216640 KB Output is correct