oj.uz

Submission #710715

# Submission time Handle Problem Language Result Execution time Memory
710715 2023-03-15T16:46:08 Z Ronin13 Crossing (JOI21_crossing) C++14
26 / 100
 1111 ms 8296 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;
const int nmax = 1000001;
map <vector <int>, bool> used;
vector <vector <int> >  vec;

vector <int> op(vector <int> &a, vector <int> &b){
    vector <int> ans;
    for(int i = 0; i < a.size(); i++){
        int x = a[i] + b[i];
        x = -x;
        x %= 3;
        x += 3;
        x %= 3;
        ans.pb(x);
    }
    return ans;
}

void rec(vector <int> &v){
    used[v] = true;
    vec.pb(v);
    vector <vector <int> > q;
    for(auto to : vec){
        vector <int> x = op(to, v);
        if(used[x]) continue;
        q.push_back(x);
        used[x] = true;
    }
    for(auto to : q)
        rec(to);
}

int L[nmax], R[nmax];

int blsize = 501;

bool good[nmax][10];
int val[nmax];
int opt[nmax][10];

vector <int> b;

void update_block(int ind, int v, int bl){
    if(opt[bl][ind] == v)
        good[bl][ind] = true;
    else good[bl][ind] = false;
    val[bl] = v;
}

void fil(int bl){
    if(val[bl] == -1) return;
    for(int i = L[bl]; i <= R[bl]; i++)
        b[i] = val[bl];
    val[bl] = -1;
}

bool check(int bl, int ind){
    for(int i = L[bl]; i <= R[bl]; i++){
        if(b[i] != vec[ind][i]) return false;
    }
    return true;
}

void update_ran(int ind, int l, int r, int v){
    int bl = l / blsize;
    good[bl][ind] = false;
    fil(bl);
    for(int i = l; i <= r; i++)
        b[i] = v;
    good[bl][ind] = check(bl, ind);
}

bool CH(int sz){
    bool ans = false;
    for(int j = 0; j < vec.size(); j++){
        bool cur = true;
        for(int i= 0; i <= sz; i++){
            cur &= good[i][j];
        }
        ans |= cur;
    }
    return ans;
}

int main(){
   // ios_base::sync_with_stdio(false); cin.tie(0);
    int n; cin >> n;
    int cur = 0;
    int curbl = 0;
    L[0] = 0;
    for(int i = 1; i < n; i++){
        if(cur + 1 > blsize){
            R[curbl] = i - 1;
            cur = 1;
            L[++curbl] = i;
        }
        else cur++;
    }
    R[curbl] = n - 1;
    for(int i = 0; i <= curbl ;i++)
        val[curbl] = -1;
    string a[3];
    for(int i = 0; i < 3; i++){
        vector<int> v;
        cin >> a[i];
        for(int j = 0; j < n; j++){
            if(a[i][j] == 'O')
                v.pb(0);
            if(a[i][j] == 'J')
                v.pb(1);
            if(a[i][j] == 'I')
                v.pb(2);
        }
        //used[v] = true;
        rec(v);
        //vec.pb(v);
    }
   // cout << vec.size() << "\n";

    int q; cin >> q;
    for(int i = 0; i < n; i++){
        char c; cin >> c;
        if(c == 'J')
            b.pb(1);
        if(c == 'O')
            b.pb(0);
        if(c == 'I')
            b.pb(2);
    }
   // cout << vec.size();
    for(int i = 0; i < n; i++){
        for(int j = 0; j < vec.size(); j++)
            update_ran(j, i, i, b[i]);
    }
    CH(curbl) ? cout << "Yes\n" : cout << "No\n";
    while(q--){
        int l,r; cin >> l >> r;
        char c; cin >> c;
        int x;
        if(c == 'O')
            x = 0;
        if(c == 'J')
            x = 1;
        if(c == 'I')
            x = 2;
        l--, r--;
        int X = l / blsize;
        int Y = r / blsize;
        if(X == Y){
            for(int j = 0; j < vec.size(); j++)
                update_ran(j, l, r, x);
        }
        else{
            for(int i = X + 1; i < Y; i++){
                for(int j = 0; j < vec.size(); j++)
                    update_block(j, x, i);
            }
            for(int j = 0; j < vec.size(); j++){
                update_ran(j, l, R[X], x);
                update_ran(j, L[Y], r, x);
            }
        }
        CH(curbl) ? cout << "Yes\n" : cout << "No\n";
    }
    return 0;
}

Compilation message

Main.cpp: In function 'std::vector<int> op(std::vector<int>&, std::vector<int>&)':
Main.cpp:17:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for(int i = 0; i < a.size(); i++){
      |                    ~~^~~~~~~~~~
Main.cpp: In function 'bool CH(int)':
Main.cpp:84:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for(int j = 0; j < vec.size(); j++){
      |                    ~~^~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:141:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |         for(int j = 0; j < vec.size(); j++)
      |                        ~~^~~~~~~~~~~~
Main.cpp:159:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  159 |             for(int j = 0; j < vec.size(); j++)
      |                            ~~^~~~~~~~~~~~
Main.cpp:164:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  164 |                 for(int j = 0; j < vec.size(); j++)
      |                                ~~^~~~~~~~~~~~
Main.cpp:167:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  167 |             for(int j = 0; j < vec.size(); j++){
      |                            ~~^~~~~~~~~~~~
Main.cpp:53:5: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   53 |     if(opt[bl][ind] == v)
      |     ^~
Main.cpp:148:13: note: 'x' was declared here
  148 |         int x;
      |             ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 315 ms 768 KB Output is correct
2 Correct 356 ms 876 KB Output is correct
3 Correct 372 ms 848 KB Output is correct
4 Correct 339 ms 952 KB Output is correct
5 Correct 354 ms 888 KB Output is correct
6 Correct 337 ms 792 KB Output is correct
7 Correct 378 ms 976 KB Output is correct
8 Correct 338 ms 1000 KB Output is correct
9 Correct 375 ms 800 KB Output is correct
10 Correct 339 ms 1044 KB Output is correct
11 Correct 393 ms 824 KB Output is correct
12 Correct 367 ms 824 KB Output is correct
13 Correct 385 ms 824 KB Output is correct
14 Correct 357 ms 912 KB Output is correct
15 Correct 359 ms 992 KB Output is correct
16 Correct 380 ms 812 KB Output is correct
17 Correct 402 ms 900 KB Output is correct
18 Correct 419 ms 856 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 315 ms 768 KB Output is correct
2 Correct 356 ms 876 KB Output is correct
3 Correct 372 ms 848 KB Output is correct
4 Correct 339 ms 952 KB Output is correct
5 Correct 354 ms 888 KB Output is correct
6 Correct 337 ms 792 KB Output is correct
7 Correct 378 ms 976 KB Output is correct
8 Correct 338 ms 1000 KB Output is correct
9 Correct 375 ms 800 KB Output is correct
10 Correct 339 ms 1044 KB Output is correct
11 Correct 393 ms 824 KB Output is correct
12 Correct 367 ms 824 KB Output is correct
13 Correct 385 ms 824 KB Output is correct
14 Correct 357 ms 912 KB Output is correct
15 Correct 359 ms 992 KB Output is correct
16 Correct 380 ms 812 KB Output is correct
17 Correct 402 ms 900 KB Output is correct
18 Correct 419 ms 856 KB Output is correct
19 Correct 916 ms 8236 KB Output is correct
20 Correct 1111 ms 8296 KB Output is correct
21 Incorrect 556 ms 7276 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 315 ms 768 KB Output is correct
2 Correct 356 ms 876 KB Output is correct
3 Correct 372 ms 848 KB Output is correct
4 Correct 339 ms 952 KB Output is correct
5 Correct 354 ms 888 KB Output is correct
6 Correct 337 ms 792 KB Output is correct
7 Correct 378 ms 976 KB Output is correct
8 Correct 338 ms 1000 KB Output is correct
9 Correct 375 ms 800 KB Output is correct
10 Correct 339 ms 1044 KB Output is correct
11 Correct 393 ms 824 KB Output is correct
12 Correct 367 ms 824 KB Output is correct
13 Correct 385 ms 824 KB Output is correct
14 Correct 357 ms 912 KB Output is correct
15 Correct 359 ms 992 KB Output is correct
16 Correct 380 ms 812 KB Output is correct
17 Correct 402 ms 900 KB Output is correct
18 Correct 419 ms 856 KB Output is correct
19 Correct 388 ms 972 KB Output is correct
20 Correct 503 ms 848 KB Output is correct
21 Correct 379 ms 896 KB Output is correct
22 Correct 356 ms 876 KB Output is correct
23 Correct 348 ms 1012 KB Output is correct
24 Correct 331 ms 860 KB Output is correct
25 Correct 371 ms 816 KB Output is correct
26 Correct 370 ms 952 KB Output is correct
27 Correct 365 ms 1012 KB Output is correct
28 Correct 324 ms 872 KB Output is correct
29 Correct 370 ms 996 KB Output is correct
30 Correct 339 ms 876 KB Output is correct
31 Correct 403 ms 936 KB Output is correct
32 Correct 373 ms 972 KB Output is correct
33 Correct 403 ms 872 KB Output is correct
34 Correct 370 ms 852 KB Output is correct
35 Correct 380 ms 924 KB Output is correct
36 Correct 388 ms 824 KB Output is correct
37 Correct 374 ms 1004 KB Output is correct
38 Correct 408 ms 892 KB Output is correct
39 Correct 393 ms 848 KB Output is correct
40 Correct 382 ms 1100 KB Output is correct
41 Correct 390 ms 892 KB Output is correct
42 Correct 400 ms 824 KB Output is correct
43 Correct 387 ms 988 KB Output is correct
44 Correct 383 ms 972 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 315 ms 768 KB Output is correct
2 Correct 356 ms 876 KB Output is correct
3 Correct 372 ms 848 KB Output is correct
4 Correct 339 ms 952 KB Output is correct
5 Correct 354 ms 888 KB Output is correct
6 Correct 337 ms 792 KB Output is correct
7 Correct 378 ms 976 KB Output is correct
8 Correct 338 ms 1000 KB Output is correct
9 Correct 375 ms 800 KB Output is correct
10 Correct 339 ms 1044 KB Output is correct
11 Correct 393 ms 824 KB Output is correct
12 Correct 367 ms 824 KB Output is correct
13 Correct 385 ms 824 KB Output is correct
14 Correct 357 ms 912 KB Output is correct
15 Correct 359 ms 992 KB Output is correct
16 Correct 380 ms 812 KB Output is correct
17 Correct 402 ms 900 KB Output is correct
18 Correct 419 ms 856 KB Output is correct
19 Correct 916 ms 8236 KB Output is correct
20 Correct 1111 ms 8296 KB Output is correct
21 Incorrect 556 ms 7276 KB Output isn't correct
22 Halted 0 ms 0 KB -