oj.uz

답안 #377437

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
377437 2021-03-14T08:12:32 Z Vimmer Sateliti (COCI20_satellti) C++14
50 / 110
 3000 ms 68580 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];

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

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

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

//        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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 876 KB Output is correct
2 Correct 2 ms 876 KB Output is correct
3 Correct 2 ms 876 KB Output is correct
4 Correct 6 ms 876 KB Output is correct
5 Correct 2 ms 876 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 6 ms 640 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 876 KB Output is correct
2 Correct 2 ms 876 KB Output is correct
3 Correct 2 ms 876 KB Output is correct
4 Correct 6 ms 876 KB Output is correct
5 Correct 2 ms 876 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 163 ms 13668 KB Output is correct
9 Correct 6 ms 876 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 148 ms 2264 KB Output is correct
12 Correct 245 ms 14816 KB Output is correct
13 Correct 154 ms 2660 KB Output is correct
14 Correct 176 ms 15144 KB Output is correct
15 Correct 164 ms 9956 KB Output is correct
16 Correct 162 ms 14560 KB Output is correct
17 Correct 303 ms 15264 KB Output is correct

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 876 KB Output is correct
2 Correct 2 ms 876 KB Output is correct
3 Correct 2 ms 876 KB Output is correct
4 Correct 6 ms 876 KB Output is correct
5 Correct 2 ms 876 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 163 ms 13668 KB Output is correct
9 Correct 6 ms 876 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 148 ms 2264 KB Output is correct
12 Correct 245 ms 14816 KB Output is correct
13 Correct 154 ms 2660 KB Output is correct
14 Correct 176 ms 15144 KB Output is correct
15 Correct 164 ms 9956 KB Output is correct
16 Correct 162 ms 14560 KB Output is correct
17 Correct 303 ms 15264 KB Output is correct
18 Execution timed out 3077 ms 68580 KB Time limit exceeded
19 Halted 0 ms 0 KB -