oj.uz

Submission #237194

# Submission time Handle Problem Language Result Execution time Memory
237194 2020-06-05T08:26:58 Z kartel Vođe (COCI17_vode) C++14
120 / 120
 587 ms 96504 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +5005
#define MaxS N * N
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int c[N], f[N][N], n, m, k, i, j;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> m >> k;
    for (i = 0; i < n; i++) cin >> c[i];

    for (i = 0; i < n; i++)
    {
        f[(i + 1) % n][m + 1] = (c[i] != c[(i + 1) % n]);
    }

    for (j = m; j >= 1; j--)
    {
        int l = j + 1, r = min(m, j + k);
        for (i = 0; i < n; i++)
        {
            int win = 0;
            if (c[i] != c[(i + 1) % n]) win = ((f[(i + 1) % n][l] - f[(i + 1) % n][r + 1]) != (r - l + 1));
                                  else  win = ((f[(i + 1) % n][l] - f[(i + 1) % n][r + 1]) > 0);

            f[i][j] = f[i][j + 1] + win;
        }
    }

    for (i = 0; i < n; i++)
    {
        if (f[i][1] != f[i][2]) cout << c[i] << " ";
                           else cout << 1 - c[i] << " ";
    }

}

//  x ^ 2 + y ^ 2 = 1
//  x * a_i + y * b_i
//  a_i = -b_i * tan(alpha)
//  a_i / -b_i = tan(alpha)
//  alpha = atan(a_i / (-b_i))

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2048 KB Output is correct
2 Correct 6 ms 2432 KB Output is correct
3 Correct 6 ms 2304 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3072 KB Output is correct
2 Correct 7 ms 2944 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2688 KB Output is correct
2 Correct 7 ms 2816 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 53 ms 19256 KB Output is correct
2 Correct 70 ms 20728 KB Output is correct
3 Correct 448 ms 94788 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 38264 KB Output is correct
2 Correct 414 ms 94516 KB Output is correct
3 Correct 128 ms 41080 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 513 ms 95352 KB Output is correct
2 Correct 9 ms 2688 KB Output is correct
3 Correct 7 ms 1664 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 467 ms 95992 KB Output is correct
2 Correct 373 ms 96352 KB Output is correct
3 Correct 587 ms 96504 KB Output is correct