oj.uz

Submission #710703

# Submission time Handle Problem Language Result Execution time Memory
710703 2023-03-15T16:02:17 Z Ronin13 Crossing (JOI21_crossing) C++14
26 / 100
 403 ms 90832 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;
    for(auto to : vec){
        vector <int> x = op(to, v);
        if(used[x]) continue;
        rec(x);
    }
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n; cin >> n;
    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;
        vec.pb(v);
    }
    for(int i = 0; i < 3; i++)
        rec(vec[i]);
    int q; cin >> q;
    vector <int> t;
    for(int i = 0; i < n; i++){
        char c; cin >> c;
        if(c == 'J')
            t.pb(1);
        if(c == 'O')
            t.pb(0);
        if(c == 'I')
            t.pb(2);
    }
    bool xx = used[t];
    if(xx) cout << "Yes\n";
    else 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;
        if(n <= 100){
        for(int i = l - 1; i < r; i++)
            t[i] = x;
        used[t] ? cout << "Yes\n" : cout << "No\n";}
        else
            xx ? 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:19:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(int i = 0; i < a.size(); i++){
      |                    ~~^~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:85:18: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   85 |             t[i] = x;

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 240 ms 61804 KB Output is correct
2 Correct 270 ms 79624 KB Output is correct
3 Correct 324 ms 29300 KB Output is correct
4 Correct 302 ms 76928 KB Output is correct
5 Correct 299 ms 75456 KB Output is correct
6 Correct 293 ms 71856 KB Output is correct
7 Correct 261 ms 61644 KB Output is correct
8 Correct 403 ms 82312 KB Output is correct
9 Correct 311 ms 78908 KB Output is correct
10 Correct 281 ms 90512 KB Output is correct
11 Correct 288 ms 84600 KB Output is correct
12 Correct 302 ms 90620 KB Output is correct
13 Correct 279 ms 84684 KB Output is correct
14 Correct 295 ms 90720 KB Output is correct
15 Correct 287 ms 84576 KB Output is correct
16 Correct 307 ms 90584 KB Output is correct
17 Correct 277 ms 84652 KB Output is correct
18 Correct 340 ms 16212 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 240 ms 61804 KB Output is correct
2 Correct 270 ms 79624 KB Output is correct
3 Correct 324 ms 29300 KB Output is correct
4 Correct 302 ms 76928 KB Output is correct
5 Correct 299 ms 75456 KB Output is correct
6 Correct 293 ms 71856 KB Output is correct
7 Correct 261 ms 61644 KB Output is correct
8 Correct 403 ms 82312 KB Output is correct
9 Correct 311 ms 78908 KB Output is correct
10 Correct 281 ms 90512 KB Output is correct
11 Correct 288 ms 84600 KB Output is correct
12 Correct 302 ms 90620 KB Output is correct
13 Correct 279 ms 84684 KB Output is correct
14 Correct 295 ms 90720 KB Output is correct
15 Correct 287 ms 84576 KB Output is correct
16 Correct 307 ms 90584 KB Output is correct
17 Correct 277 ms 84652 KB Output is correct
18 Correct 340 ms 16212 KB Output is correct
19 Correct 69 ms 10596 KB Output is correct
20 Correct 75 ms 11712 KB Output is correct
21 Incorrect 97 ms 9984 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 240 ms 61804 KB Output is correct
2 Correct 270 ms 79624 KB Output is correct
3 Correct 324 ms 29300 KB Output is correct
4 Correct 302 ms 76928 KB Output is correct
5 Correct 299 ms 75456 KB Output is correct
6 Correct 293 ms 71856 KB Output is correct
7 Correct 261 ms 61644 KB Output is correct
8 Correct 403 ms 82312 KB Output is correct
9 Correct 311 ms 78908 KB Output is correct
10 Correct 281 ms 90512 KB Output is correct
11 Correct 288 ms 84600 KB Output is correct
12 Correct 302 ms 90620 KB Output is correct
13 Correct 279 ms 84684 KB Output is correct
14 Correct 295 ms 90720 KB Output is correct
15 Correct 287 ms 84576 KB Output is correct
16 Correct 307 ms 90584 KB Output is correct
17 Correct 277 ms 84652 KB Output is correct
18 Correct 340 ms 16212 KB Output is correct
19 Correct 266 ms 76108 KB Output is correct
20 Correct 339 ms 29508 KB Output is correct
21 Correct 317 ms 85732 KB Output is correct
22 Correct 257 ms 52908 KB Output is correct
23 Correct 341 ms 86636 KB Output is correct
24 Correct 287 ms 70440 KB Output is correct
25 Correct 306 ms 85688 KB Output is correct
26 Correct 230 ms 58508 KB Output is correct
27 Correct 334 ms 86016 KB Output is correct
28 Correct 274 ms 73104 KB Output is correct
29 Correct 287 ms 81152 KB Output is correct
30 Correct 266 ms 54616 KB Output is correct
31 Correct 298 ms 87928 KB Output is correct
32 Correct 269 ms 81172 KB Output is correct
33 Correct 299 ms 82772 KB Output is correct
34 Correct 237 ms 58768 KB Output is correct
35 Correct 293 ms 90600 KB Output is correct
36 Correct 250 ms 84672 KB Output is correct
37 Correct 312 ms 90832 KB Output is correct
38 Correct 242 ms 84696 KB Output is correct
39 Correct 262 ms 90720 KB Output is correct
40 Correct 278 ms 84604 KB Output is correct
41 Correct 262 ms 90444 KB Output is correct
42 Correct 284 ms 84580 KB Output is correct
43 Correct 252 ms 64220 KB Output is correct
44 Correct 298 ms 82380 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 240 ms 61804 KB Output is correct
2 Correct 270 ms 79624 KB Output is correct
3 Correct 324 ms 29300 KB Output is correct
4 Correct 302 ms 76928 KB Output is correct
5 Correct 299 ms 75456 KB Output is correct
6 Correct 293 ms 71856 KB Output is correct
7 Correct 261 ms 61644 KB Output is correct
8 Correct 403 ms 82312 KB Output is correct
9 Correct 311 ms 78908 KB Output is correct
10 Correct 281 ms 90512 KB Output is correct
11 Correct 288 ms 84600 KB Output is correct
12 Correct 302 ms 90620 KB Output is correct
13 Correct 279 ms 84684 KB Output is correct
14 Correct 295 ms 90720 KB Output is correct
15 Correct 287 ms 84576 KB Output is correct
16 Correct 307 ms 90584 KB Output is correct
17 Correct 277 ms 84652 KB Output is correct
18 Correct 340 ms 16212 KB Output is correct
19 Correct 69 ms 10596 KB Output is correct
20 Correct 75 ms 11712 KB Output is correct
21 Incorrect 97 ms 9984 KB Output isn't correct
22 Halted 0 ms 0 KB -