oj.uz

Submission #366280

# Submission time Handle Problem Language Result Execution time Memory
366280 2021-02-13T18:58:10 Z model_code Sateliti (COCI20_satellti) C++17
110 / 110
 494 ms 34412 KB 
#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cerr << #x << " = " << x << endl
#define _ << " _ " <<

#define fi first
#define se second

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

const int MAXN = 1010, MOD = 1e9 + 7, P = 2, Q = 3;

int pq_pow[2 * MAXN][2 * MAXN];
int h[2 * MAXN][2 * MAXN];

int add(int a, int b) {
    int res = a + b;
    if (res >= MOD) res -= MOD;
    return res;
}
int sub(int a, int b) { return add(a, MOD - b); }
int mul(int a, int b) { return (ll)a * b % MOD; }

void precalc(const vector<string>& a) {
    for (int i = 0; i < 2 * MAXN; i++) {
        for (int j = 0; j < 2 * MAXN; j++) {
            if (i == 0 && j == 0) pq_pow[i][j] = 1;
            else if (i == 0) pq_pow[i][j] = mul(pq_pow[i][j - 1], Q);
            else pq_pow[i][j] = mul(pq_pow[i - 1][j], P);
        }
    }

    int n = a.size(), m = a[0].size();
    for (int i = 0; i < 2 * n; i++) {
        for (int j = 0; j < 2 * m; j++) {
            int val = mul(a[i % n][j % m] == '.', pq_pow[i][j]);
            h[i + 1][j + 1] = sub(add(val,
                        add(h[i + 1][j], h[i][j + 1])),
                    h[i][j]);
        }
    }
}

int get_h(int x, int y, int dx, int dy) {
    return sub(add(h[x + dx][y + dy], h[x][y]),
            add(h[x][y + dy], h[x + dx][y]));
}

bool is_equal(int x1, int y1, int x2, int y2, int dx, int dy) {
    int val1 = mul(get_h(x1, y1, dx, dy), pq_pow[x2][y2]);
    int val2 = mul(get_h(x2, y2, dx, dy), pq_pow[x1][y1]);
    return val1 == val2;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n, m;
    cin >> n >> m;

    vector<string> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];

    precalc(a);

    int sol_x = 0, sol_y = 0;
    for (int x = 0; x < n; x++) {
        for (int y = 0; y < m; y++) {
            int lo_dx = 0, hi_dx = n;
            while (lo_dx + 1 < hi_dx) {
                int dx = (lo_dx + hi_dx) / 2;
                if (is_equal(sol_x, sol_y, x, y, dx, m)) lo_dx = dx;
                else hi_dx = dx;
            }
            int dx = lo_dx;

            int lo_dy = 0, hi_dy = m;
            while (lo_dy + 1 < hi_dy) {
                int dy = (lo_dy + hi_dy) / 2;
                if (is_equal(sol_x + dx, sol_y, x + dx, y, 1, dy)) lo_dy = dy;
                else hi_dy = dy;
            }
            int dy = lo_dy;


            if (a[(x + dx) % n][(y + dy) % m] <
                a[(sol_x + dx) % n][(sol_y + dy) % m]) {
                sol_x = x;
                sol_y = y;
            }
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++)
            cout << a[(sol_x + i) % n][(sol_y + j) % m];
        cout << '\n';
    }

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 16764 KB Output is correct
2 Correct 20 ms 16748 KB Output is correct
3 Correct 22 ms 16748 KB Output is correct
4 Correct 19 ms 16748 KB Output is correct
5 Correct 19 ms 16748 KB Output is correct
6 Correct 23 ms 16748 KB Output is correct
7 Correct 19 ms 16748 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 16764 KB Output is correct
2 Correct 20 ms 16748 KB Output is correct
3 Correct 22 ms 16748 KB Output is correct
4 Correct 19 ms 16748 KB Output is correct
5 Correct 19 ms 16748 KB Output is correct
6 Correct 23 ms 16748 KB Output is correct
7 Correct 19 ms 16748 KB Output is correct
8 Correct 53 ms 20204 KB Output is correct
9 Correct 19 ms 16364 KB Output is correct
10 Correct 20 ms 18668 KB Output is correct
11 Correct 52 ms 20204 KB Output is correct
12 Correct 55 ms 20204 KB Output is correct
13 Correct 53 ms 20332 KB Output is correct
14 Correct 56 ms 20332 KB Output is correct
15 Correct 57 ms 20332 KB Output is correct
16 Correct 56 ms 20332 KB Output is correct
17 Correct 58 ms 20332 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 16764 KB Output is correct
2 Correct 20 ms 16748 KB Output is correct
3 Correct 22 ms 16748 KB Output is correct
4 Correct 19 ms 16748 KB Output is correct
5 Correct 19 ms 16748 KB Output is correct
6 Correct 23 ms 16748 KB Output is correct
7 Correct 19 ms 16748 KB Output is correct
8 Correct 53 ms 20204 KB Output is correct
9 Correct 19 ms 16364 KB Output is correct
10 Correct 20 ms 18668 KB Output is correct
11 Correct 52 ms 20204 KB Output is correct
12 Correct 55 ms 20204 KB Output is correct
13 Correct 53 ms 20332 KB Output is correct
14 Correct 56 ms 20332 KB Output is correct
15 Correct 57 ms 20332 KB Output is correct
16 Correct 56 ms 20332 KB Output is correct
17 Correct 58 ms 20332 KB Output is correct
18 Correct 440 ms 34316 KB Output is correct
19 Correct 27 ms 24556 KB Output is correct
20 Correct 25 ms 16620 KB Output is correct
21 Correct 422 ms 34304 KB Output is correct
22 Correct 492 ms 34412 KB Output is correct
23 Correct 427 ms 34412 KB Output is correct
24 Correct 494 ms 34284 KB Output is correct
25 Correct 427 ms 34412 KB Output is correct
26 Correct 486 ms 34304 KB Output is correct
27 Correct 491 ms 34156 KB Output is correct