oj.uz

Submission #377428

# Submission time Handle Problem Language Result Execution time Memory
377428 2021-03-14T08:07:33 Z Vimmer Sateliti (COCI20_satellti) C++14
10 / 110
 159 ms 4100 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 305
#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;

int kl[N];

vector <int> psr[N];

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

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

    int mx = 0;

    for (int i = 0; i < n; i++)
    {
        int sk = 0;

        bool ft = 0;

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

                if (kl[i] < sk)
                {
                    kl[i] = sk;
                }
            }
            else
            {
                sk = 0;
            }

            if (j == m - 1 && !ft && sk != 0 && s[i][0] != '.')
            {
                j = -1;

                ft = 1;
            }
        }

        mx = max(mx, kl[i]);

        sk = 0;

        ft = 0;

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

                if (kl[i] == sk)
                {
                    psr[i].PB((j - sk + 1 + m) % m);
                }
            }
            else
            {
                sk = 0;

                if (ft)
                    break;
            }

            if (j == m - 1 && !ft && sk != 0 && s[i][0] != '.')
            {
                j = -1;

                ft = 1;
            }
        }
    }

    if (mx == 0)
    {
        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++)
    {
        if (kl[i] < mx) continue;

        for (auto it : psr[i])
        {
            vr.PB({i, it});
        }
    }

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

    int u = 0;

    while (sz(vr) > 1 && u < n)
    {
        nx.clear();

        nx.PB(vr[0]);

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

        for (int t = 1; t < sz(vr); t++)
        {
            nl = bt[(vr[t].F + u) % n][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 2 ms 748 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 1 ms 620 KB Output is correct
4 Correct 1 ms 620 KB Output is correct
5 Correct 1 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 748 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 1 ms 620 KB Output is correct
4 Correct 1 ms 620 KB Output is correct
5 Correct 1 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 159 ms 4076 KB Output is correct
9 Correct 6 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 142 ms 780 KB Output is correct
12 Incorrect 145 ms 4100 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 748 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 1 ms 620 KB Output is correct
4 Correct 1 ms 620 KB Output is correct
5 Correct 1 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 159 ms 4076 KB Output is correct
9 Correct 6 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 142 ms 780 KB Output is correct
12 Incorrect 145 ms 4100 KB Output isn't correct
13 Halted 0 ms 0 KB -