oj.uz

Submission #780738

# Submission time Handle Problem Language Result Execution time Memory
780738 2023-07-12T12:30:36 Z Rafi22 Crossing (JOI21_crossing) C++14
26 / 100
 7000 ms 11832 KB 
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

map<vector<int>,bool>odw;

const int N=200007,pot=1<<18;

int a[N][3];
int b[N][9];
int c[N];
int id[300];

int n;

void get()
{
    bool ans=0;
    for(int j=0;j<9;j++)
    {
        bool is=1;
        for(int i=1;i<=n;i++) is&=b[i][j]==c[i];
        ans|=is;
    }
    if(ans) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    vector<vector<int>>V;
    V.pb({1,0,0});
    odw[{1,0,0}]=1;
    V.pb({0,1,0});
    odw[{0,1,0}]=1;
    V.pb({0,0,1});
    odw[{0,0,1}]=1;
    for(int i=0;i<sz(V);i++)
    {
        for(int j=0;j<i;j++)
        {
            vector<int>X(3);
            for(int l=0;l<3;l++)
            {
                X[l]=(-V[i][l]-V[j][l]+6)%3;
            }
            if(!odw[X])
            {
                V.pb(X);
                odw[X]=1;
            }
        }
    }
    id['J']=0;
    id['O']=1;
    id['I']=2;
    cin>>n;
    string s;
    for(int j=0;j<3;j++)
    {
        cin>>s;
        for(int i=1;i<=n;i++) a[i][j]=id[s[i-1]];
    }
    for(int j=0;j<9;j++)
    {
        for(int i=1;i<=n;i++)
        {
            for(int l=0;l<3;l++)
            {
                b[i][j]=(b[i][j]+a[i][l]*V[j][l])%3;
            }
        }
    }
    int q;
    cin>>q>>s;
    for(int i=1;i<=n;i++) c[i]=id[s[i-1]];
    get();
    while(q--)
    {
        int l,r;
        char x;
        cin>>l>>r>>x;
        for(int i=l;i<=r;i++) c[i]=id[x];
        get();
    }

    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:76:48: warning: array subscript has type 'char' [-Wchar-subscripts]
   76 |         for(int i=1;i<=n;i++) a[i][j]=id[s[i-1]];
      |                                                ^
Main.cpp:90:41: warning: array subscript has type 'char' [-Wchar-subscripts]
   90 |     for(int i=1;i<=n;i++) c[i]=id[s[i-1]];
      |                                         ^
Main.cpp:97:39: warning: array subscript has type 'char' [-Wchar-subscripts]
   97 |         for(int i=l;i<=r;i++) c[i]=id[x];
      |                                       ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 2316 KB Output is correct
2 Correct 165 ms 2464 KB Output is correct
3 Correct 163 ms 2328 KB Output is correct
4 Correct 147 ms 2276 KB Output is correct
5 Correct 139 ms 2328 KB Output is correct
6 Correct 142 ms 2296 KB Output is correct
7 Correct 129 ms 2328 KB Output is correct
8 Correct 157 ms 2396 KB Output is correct
9 Correct 158 ms 2408 KB Output is correct
10 Correct 155 ms 2420 KB Output is correct
11 Correct 154 ms 2428 KB Output is correct
12 Correct 157 ms 2456 KB Output is correct
13 Correct 159 ms 2456 KB Output is correct
14 Correct 161 ms 2536 KB Output is correct
15 Correct 155 ms 2380 KB Output is correct
16 Correct 156 ms 2428 KB Output is correct
17 Correct 157 ms 2432 KB Output is correct
18 Correct 165 ms 2356 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 2316 KB Output is correct
2 Correct 165 ms 2464 KB Output is correct
3 Correct 163 ms 2328 KB Output is correct
4 Correct 147 ms 2276 KB Output is correct
5 Correct 139 ms 2328 KB Output is correct
6 Correct 142 ms 2296 KB Output is correct
7 Correct 129 ms 2328 KB Output is correct
8 Correct 157 ms 2396 KB Output is correct
9 Correct 158 ms 2408 KB Output is correct
10 Correct 155 ms 2420 KB Output is correct
11 Correct 154 ms 2428 KB Output is correct
12 Correct 157 ms 2456 KB Output is correct
13 Correct 159 ms 2456 KB Output is correct
14 Correct 161 ms 2536 KB Output is correct
15 Correct 155 ms 2380 KB Output is correct
16 Correct 156 ms 2428 KB Output is correct
17 Correct 157 ms 2432 KB Output is correct
18 Correct 165 ms 2356 KB Output is correct
19 Execution timed out 7083 ms 11832 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 2316 KB Output is correct
2 Correct 165 ms 2464 KB Output is correct
3 Correct 163 ms 2328 KB Output is correct
4 Correct 147 ms 2276 KB Output is correct
5 Correct 139 ms 2328 KB Output is correct
6 Correct 142 ms 2296 KB Output is correct
7 Correct 129 ms 2328 KB Output is correct
8 Correct 157 ms 2396 KB Output is correct
9 Correct 158 ms 2408 KB Output is correct
10 Correct 155 ms 2420 KB Output is correct
11 Correct 154 ms 2428 KB Output is correct
12 Correct 157 ms 2456 KB Output is correct
13 Correct 159 ms 2456 KB Output is correct
14 Correct 161 ms 2536 KB Output is correct
15 Correct 155 ms 2380 KB Output is correct
16 Correct 156 ms 2428 KB Output is correct
17 Correct 157 ms 2432 KB Output is correct
18 Correct 165 ms 2356 KB Output is correct
19 Correct 156 ms 2316 KB Output is correct
20 Correct 166 ms 2232 KB Output is correct
21 Correct 155 ms 2368 KB Output is correct
22 Correct 99 ms 2200 KB Output is correct
23 Correct 156 ms 2380 KB Output is correct
24 Correct 128 ms 2292 KB Output is correct
25 Correct 156 ms 2460 KB Output is correct
26 Correct 109 ms 2328 KB Output is correct
27 Correct 171 ms 2472 KB Output is correct
28 Correct 132 ms 2232 KB Output is correct
29 Correct 154 ms 2380 KB Output is correct
30 Correct 101 ms 2244 KB Output is correct
31 Correct 155 ms 2368 KB Output is correct
32 Correct 148 ms 2348 KB Output is correct
33 Correct 161 ms 2512 KB Output is correct
34 Correct 112 ms 2300 KB Output is correct
35 Correct 181 ms 2376 KB Output is correct
36 Correct 154 ms 2420 KB Output is correct
37 Correct 155 ms 2408 KB Output is correct
38 Correct 167 ms 2352 KB Output is correct
39 Correct 154 ms 2396 KB Output is correct
40 Correct 154 ms 2376 KB Output is correct
41 Correct 154 ms 2380 KB Output is correct
42 Correct 158 ms 2408 KB Output is correct
43 Correct 123 ms 2380 KB Output is correct
44 Correct 155 ms 2388 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 2316 KB Output is correct
2 Correct 165 ms 2464 KB Output is correct
3 Correct 163 ms 2328 KB Output is correct
4 Correct 147 ms 2276 KB Output is correct
5 Correct 139 ms 2328 KB Output is correct
6 Correct 142 ms 2296 KB Output is correct
7 Correct 129 ms 2328 KB Output is correct
8 Correct 157 ms 2396 KB Output is correct
9 Correct 158 ms 2408 KB Output is correct
10 Correct 155 ms 2420 KB Output is correct
11 Correct 154 ms 2428 KB Output is correct
12 Correct 157 ms 2456 KB Output is correct
13 Correct 159 ms 2456 KB Output is correct
14 Correct 161 ms 2536 KB Output is correct
15 Correct 155 ms 2380 KB Output is correct
16 Correct 156 ms 2428 KB Output is correct
17 Correct 157 ms 2432 KB Output is correct
18 Correct 165 ms 2356 KB Output is correct
19 Execution timed out 7083 ms 11832 KB Time limit exceeded
20 Halted 0 ms 0 KB -