oj.uz

Submission #710702

# Submission time Handle Problem Language Result Execution time Memory
710702 2023-03-15T16:00:24 Z Ronin13 Crossing (JOI21_crossing) C++14
26 / 100
 7000 ms 92152 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);
    }
    if(used[t]) 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";
    }
    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:84:18: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   84 |             t[i] = x;

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 63192 KB Output is correct
2 Correct 289 ms 81100 KB Output is correct
3 Correct 363 ms 30772 KB Output is correct
4 Correct 310 ms 78480 KB Output is correct
5 Correct 308 ms 76872 KB Output is correct
6 Correct 322 ms 73304 KB Output is correct
7 Correct 271 ms 63080 KB Output is correct
8 Correct 327 ms 83808 KB Output is correct
9 Correct 335 ms 80464 KB Output is correct
10 Correct 262 ms 91976 KB Output is correct
11 Correct 307 ms 86204 KB Output is correct
12 Correct 281 ms 92000 KB Output is correct
13 Correct 312 ms 86112 KB Output is correct
14 Correct 272 ms 92132 KB Output is correct
15 Correct 291 ms 86320 KB Output is correct
16 Correct 284 ms 92152 KB Output is correct
17 Correct 253 ms 86288 KB Output is correct
18 Correct 312 ms 17540 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 63192 KB Output is correct
2 Correct 289 ms 81100 KB Output is correct
3 Correct 363 ms 30772 KB Output is correct
4 Correct 310 ms 78480 KB Output is correct
5 Correct 308 ms 76872 KB Output is correct
6 Correct 322 ms 73304 KB Output is correct
7 Correct 271 ms 63080 KB Output is correct
8 Correct 327 ms 83808 KB Output is correct
9 Correct 335 ms 80464 KB Output is correct
10 Correct 262 ms 91976 KB Output is correct
11 Correct 307 ms 86204 KB Output is correct
12 Correct 281 ms 92000 KB Output is correct
13 Correct 312 ms 86112 KB Output is correct
14 Correct 272 ms 92132 KB Output is correct
15 Correct 291 ms 86320 KB Output is correct
16 Correct 284 ms 92152 KB Output is correct
17 Correct 253 ms 86288 KB Output is correct
18 Correct 312 ms 17540 KB Output is correct
19 Execution timed out 7014 ms 9044 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 63192 KB Output is correct
2 Correct 289 ms 81100 KB Output is correct
3 Correct 363 ms 30772 KB Output is correct
4 Correct 310 ms 78480 KB Output is correct
5 Correct 308 ms 76872 KB Output is correct
6 Correct 322 ms 73304 KB Output is correct
7 Correct 271 ms 63080 KB Output is correct
8 Correct 327 ms 83808 KB Output is correct
9 Correct 335 ms 80464 KB Output is correct
10 Correct 262 ms 91976 KB Output is correct
11 Correct 307 ms 86204 KB Output is correct
12 Correct 281 ms 92000 KB Output is correct
13 Correct 312 ms 86112 KB Output is correct
14 Correct 272 ms 92132 KB Output is correct
15 Correct 291 ms 86320 KB Output is correct
16 Correct 284 ms 92152 KB Output is correct
17 Correct 253 ms 86288 KB Output is correct
18 Correct 312 ms 17540 KB Output is correct
19 Correct 275 ms 76160 KB Output is correct
20 Correct 357 ms 29400 KB Output is correct
21 Correct 313 ms 85672 KB Output is correct
22 Correct 255 ms 52928 KB Output is correct
23 Correct 321 ms 86712 KB Output is correct
24 Correct 293 ms 70460 KB Output is correct
25 Correct 282 ms 85656 KB Output is correct
26 Correct 240 ms 58740 KB Output is correct
27 Correct 336 ms 86084 KB Output is correct
28 Correct 271 ms 73080 KB Output is correct
29 Correct 308 ms 81216 KB Output is correct
30 Correct 250 ms 54568 KB Output is correct
31 Correct 378 ms 87944 KB Output is correct
32 Correct 287 ms 81248 KB Output is correct
33 Correct 343 ms 82708 KB Output is correct
34 Correct 220 ms 58820 KB Output is correct
35 Correct 326 ms 90468 KB Output is correct
36 Correct 254 ms 84792 KB Output is correct
37 Correct 274 ms 90648 KB Output is correct
38 Correct 290 ms 84676 KB Output is correct
39 Correct 261 ms 90828 KB Output is correct
40 Correct 286 ms 84672 KB Output is correct
41 Correct 278 ms 90612 KB Output is correct
42 Correct 273 ms 84664 KB Output is correct
43 Correct 286 ms 64248 KB Output is correct
44 Correct 281 ms 82396 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 63192 KB Output is correct
2 Correct 289 ms 81100 KB Output is correct
3 Correct 363 ms 30772 KB Output is correct
4 Correct 310 ms 78480 KB Output is correct
5 Correct 308 ms 76872 KB Output is correct
6 Correct 322 ms 73304 KB Output is correct
7 Correct 271 ms 63080 KB Output is correct
8 Correct 327 ms 83808 KB Output is correct
9 Correct 335 ms 80464 KB Output is correct
10 Correct 262 ms 91976 KB Output is correct
11 Correct 307 ms 86204 KB Output is correct
12 Correct 281 ms 92000 KB Output is correct
13 Correct 312 ms 86112 KB Output is correct
14 Correct 272 ms 92132 KB Output is correct
15 Correct 291 ms 86320 KB Output is correct
16 Correct 284 ms 92152 KB Output is correct
17 Correct 253 ms 86288 KB Output is correct
18 Correct 312 ms 17540 KB Output is correct
19 Execution timed out 7014 ms 9044 KB Time limit exceeded
20 Halted 0 ms 0 KB -