oj.uz

Submission #377563

# Submission time Handle Problem Language Result Execution time Memory
377563 2021-03-14T10:13:11 Z Vimmer Sateliti (COCI20_satellti) C++14
50 / 110
 3000 ms 147020 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")

#define N 1001
#define NN 1005000
#define PB push_back
#define M ll(1e9 + 7)
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size())
#define pri(x) cout << x << endl
#define endl '\n'
#define _ << " " <<
#define F first
#define S second

using namespace std;
//using namespace __gnu_pbds;

//typedef tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> oredered_set;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef short int si;

bitset <N> bt[N][N], nl, cur, cp;

vector <pair <int, int> > vr;

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

//    freopen("1.in", "r", stdin);

    int n, m;

    cin >> n >> m;

    string s[n];

    for (int i = 0; i < n; i++)
        cin >> s[i];

    bool ft = 1;

    int kl = 0;

    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
        {
            if (s[i][j] == '*')
                {
                    bt[i][0][j] = 1;

                    ft = 0;

                    kl++;
                }
        }

    if (ft || kl == n * m)
    {
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
                cout << s[i][j];

            cout << endl;
        }

        exit(0);
    }

    for (int i = 0; i < n; i++)
        for (int u = 1; u < m; u++)
        {
            bt[i][u] = bt[i][u - 1];

            bt[i][u] >>= 1;

            if (s[i][u - 1] == '*')
                bt[i][u][m - 1] = 1;
        }

//    if (n > 300 || m > 300)
//        exit(0);

    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            vr.PB({i, j});

    bool fr = 0;

    if (n > 300 || m > 300)
        fr = 1;

    vector <pair <int, int> > nx; nx.clear();

    int u = 0;

    int val = 0;

    while (sz(vr) > 1 && u < n && (val <= int(6 * 1e7) || !fr))
    {
        val += sz(vr);

        nx.clear();

        nx.PB(vr[0]);

        cur = bt[(vr[0].F + u) % n][vr[0].S];

//        cur >>= (vr[0].S);

        for (int t = 1; t < sz(vr); t++)
        {
            nl = bt[(vr[t].F + u) % n][vr[t].S];

//            nl >>= (vr[t].S);

            cp = (nl ^ cur);

            int ps = cp._Find_next(-1);

            if (ps == N)
            {
                nx.PB(vr[t]);
            }
            else if (cur[ps] == 0)
            {
                nx.clear();

                nx.PB(vr[t]);

                cur = nl;
            }
        }

        u++;

        vr = nx;
    }

    int x = vr[0].F, y = vr[0].S;

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
            cout << s[(x + i) % n][(y + j) % m];

        cout << endl;
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 876 KB Output is correct
2 Correct 1 ms 876 KB Output is correct
3 Correct 1 ms 876 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 876 KB Output is correct
6 Correct 1 ms 876 KB Output is correct
7 Correct 1 ms 364 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 876 KB Output is correct
2 Correct 1 ms 876 KB Output is correct
3 Correct 1 ms 876 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 876 KB Output is correct
6 Correct 1 ms 876 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 20 ms 13796 KB Output is correct
9 Correct 1 ms 876 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 18 ms 13668 KB Output is correct
12 Correct 138 ms 14816 KB Output is correct
13 Correct 18 ms 14052 KB Output is correct
14 Correct 41 ms 15200 KB Output is correct
15 Correct 18 ms 14052 KB Output is correct
16 Correct 21 ms 14560 KB Output is correct
17 Correct 202 ms 15200 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 876 KB Output is correct
2 Correct 1 ms 876 KB Output is correct
3 Correct 1 ms 876 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 876 KB Output is correct
6 Correct 1 ms 876 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 20 ms 13796 KB Output is correct
9 Correct 1 ms 876 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 18 ms 13668 KB Output is correct
12 Correct 138 ms 14816 KB Output is correct
13 Correct 18 ms 14052 KB Output is correct
14 Correct 41 ms 15200 KB Output is correct
15 Correct 18 ms 14052 KB Output is correct
16 Correct 21 ms 14560 KB Output is correct
17 Correct 202 ms 15200 KB Output is correct
18 Correct 184 ms 135628 KB Output is correct
19 Correct 5 ms 6124 KB Output is correct
20 Correct 5 ms 3180 KB Output is correct
21 Correct 183 ms 136396 KB Output is correct
22 Execution timed out 3027 ms 147020 KB Time limit exceeded
23 Halted 0 ms 0 KB -