oj.uz

Submission #813169

# Submission time Handle Problem Language Result Execution time Memory
813169 2023-08-07T14:02:56 Z Cookie Crossing (JOI21_crossing) C++14
0 / 100
 134 ms 2432 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("VNOICUP.INP");
ofstream fout("VNOICUP.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ld PI = 3.14159265359;
using u128 = __uint128_t;
//const int x[4] = {1, -1, 0, 0};
//const int y[4] = {0, 0, 1, -1};
const ll mod = 1e9 + 9;
const int mxn = 2e5 + 5, mxq = 2e5 + 5, sq = 400, mxv = 2e5 + 5;
//const int base = (1 << 18);
const int inf = 1e9, neg = -69420;
map<ll, int>mp;
int to[mxn + 1];
ll pw[mxn + 1], n, q;
string s[3], t;
string conv(string a, string b){
    string res = "";
    for(int i = 0; i < sz(a); i++){
        if(a[i] == b[i])res += a[i];
        else if(a[i] == 'J'){
            if(b[i] = 'O')res += 'I';
            else res += 'O';
        }else if(a[i] == 'O'){
            if(b[i] == 'J')res += 'I';
            else res += 'J';
        }else{
            if(b[i] == 'O')res += 'J';
            else res += 'O';
        }
    }
    return(res);
}
ll gethash(string s){
    ll ans = 0;
    for(int i = 0; i < sz(s); i++){
        ans += pw[i] * to[s[i]];
        ans %= mod;
    }
    return(ans);
}
void solve(int mask, string curr){
    mp[gethash(curr)] = 1;
    if(mask == (1 << 3) - 1){
        return;
    }
    for(int i = 0; i < 3; i++){
        if(!(mask & (1 << i))){
            solve(mask | (1 << i), conv(curr, s[i]));
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    pw[0] = 1;
    for(int i = 1; i <= n; i++){
        pw[i] = (pw[i - 1] * 3) % mod;
    }
    to['J'] = 0; to['O'] = 1; to['I'] = 2;
    cin >> s[0] >> s[1] >> s[2];
    vt<int>v;
    for(int i = 0; i < 3; i++){
        solve((1 << i), s[i]);
    }
    
    
    cin >> q;
    cin >> t;
    ll ht = gethash(t);
    if(mp.find(ht) != mp.end())cout << "Yes";
    else cout << "No";
    cout << "\n";
    while(q--){
        int l, r; char c; cin >> l >> r >> c; l--; r--;
        for(int i = l; i <= r; i++)t[i] = c;
        ll ht = gethash(t);
        if(mp.find(ht) != mp.end())cout << "Yes";
        else cout << "No";
        cout << "\n";
    }
    
}

Compilation message

Main.cpp: In function 'std::string conv(std::string, std::string)':
Main.cpp:35:21: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   35 |             if(b[i] = 'O')res += 'I';
Main.cpp: In function 'long long int gethash(std::string)':
Main.cpp:50:31: warning: array subscript has type 'char' [-Wchar-subscripts]
   50 |         ans += pw[i] * to[s[i]];
      |                               ^

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 2220 KB Output is correct
2 Correct 125 ms 2432 KB Output is correct
3 Correct 134 ms 2332 KB Output is correct
4 Correct 107 ms 2272 KB Output is correct
5 Correct 101 ms 2296 KB Output is correct
6 Correct 104 ms 2320 KB Output is correct
7 Correct 91 ms 2368 KB Output is correct
8 Correct 118 ms 2360 KB Output is correct
9 Correct 118 ms 2432 KB Output is correct
10 Incorrect 120 ms 2424 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 2220 KB Output is correct
2 Correct 125 ms 2432 KB Output is correct
3 Correct 134 ms 2332 KB Output is correct
4 Correct 107 ms 2272 KB Output is correct
5 Correct 101 ms 2296 KB Output is correct
6 Correct 104 ms 2320 KB Output is correct
7 Correct 91 ms 2368 KB Output is correct
8 Correct 118 ms 2360 KB Output is correct
9 Correct 118 ms 2432 KB Output is correct
10 Incorrect 120 ms 2424 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 2220 KB Output is correct
2 Correct 125 ms 2432 KB Output is correct
3 Correct 134 ms 2332 KB Output is correct
4 Correct 107 ms 2272 KB Output is correct
5 Correct 101 ms 2296 KB Output is correct
6 Correct 104 ms 2320 KB Output is correct
7 Correct 91 ms 2368 KB Output is correct
8 Correct 118 ms 2360 KB Output is correct
9 Correct 118 ms 2432 KB Output is correct
10 Incorrect 120 ms 2424 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 2220 KB Output is correct
2 Correct 125 ms 2432 KB Output is correct
3 Correct 134 ms 2332 KB Output is correct
4 Correct 107 ms 2272 KB Output is correct
5 Correct 101 ms 2296 KB Output is correct
6 Correct 104 ms 2320 KB Output is correct
7 Correct 91 ms 2368 KB Output is correct
8 Correct 118 ms 2360 KB Output is correct
9 Correct 118 ms 2432 KB Output is correct
10 Incorrect 120 ms 2424 KB Output isn't correct
11 Halted 0 ms 0 KB -