oj.uz

답안 #419982

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419982 2021-06-07T20:51:40 Z davi_bart Crossing (JOI21_crossing) C++14
26 / 100
 7000 ms 5656 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define fi first
#define se second
#define ld long double
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int N,Q;
set<string> k;
string a,b,c;
string t;
vector<vector<int> > h;
const int dim=100;
const int p=257,mod=1e9+9;
vector<int> pot;
vector<int> tt;
int hasha(string q){
    int l=0;
    for(auto k:q)l=(l*p+k)%mod;
    for(int i=q.size();i<dim;i++)l=l*p%mod;
    return l;
}
void solve(){
    for(auto v:h){
        bool ok=1;
        for(int i=0;i<v.size();i++)if(v[i]!=tt[i])ok=0;
        if(ok){
            cout<<"Yes\n";
            return;
        }
    }
    cout<<"No\n";
}
string cross(string x,string y){
    string ans="";
    vector<char> s={'I','J','O'};
    for(int i=0;i<x.size();i++){
        if(x[i]==y[i])ans+=x[i];
        else{
            for(auto h:s)if(x[i]!=h && y[i]!=h)ans+=h;
        }
    }
    return ans;
}
void calc(){
    while(1){
        bool ok=0;
        for(auto x:k){
            for(auto y:k){
                string h=cross(x,y);
                if(k.count(h))continue;
                ok=1;
                k.insert(h);
            }
        }
        if(!ok)break;
    }
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);
    cin>>N>>a>>b>>c>>Q>>t;
    k.insert(a);k.insert(b);k.insert(c);
    calc();
    assert(k.size()<10);
    pot={1};
    for(int i=0;i<300010;i++)pot.pb(pot.back()*p%mod);

    for(auto y:k){
        h.pb(vector<int> ());
        for(int i=0;i*dim<N;i++){
            string cur="";
            for(int j=dim*i;j<min(N,dim*(i+1));j++){
                cur+=y[j];
            }
            h.back().pb(hasha(cur));
            //cout<<"iniziali: "<<h.back().back()<<endl;
        }
    }
    for(int i=0;i*dim<N;i++){
        string cur="";
        for(int j=dim*i;j<min(N,dim*(i+1));j++){
            cur+=t[j];
        }
        tt.pb(hasha(cur));
    }
    //cout<<tt[0]<<" "<<hasha(t)<<endl;
    solve();
    for(int i=0;i<Q;i++){
        int x,y;
        char z;
        cin>>x>>y>>z;
        x--;y--;
        for(int j=x;j<=y/* && j%dim!=0*/;j++){
            int pp=j/dim;
            tt[pp]-=t[j]*pot[dim-j%dim-1];
            t[j]=z;
            tt[pp]+=z*pot[dim-j%dim-1];
            tt[pp]=(tt[pp]%mod+mod)%mod;
        }
        //cout<<tt[0]<<" "<<hasha(t)<<endl;
        solve();
    }
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:29:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |         for(int i=0;i<v.size();i++)if(v[i]!=tt[i])ok=0;
      |                     ~^~~~~~~~~
Main.cpp: In function 'std::string cross(std::string, std::string)':
Main.cpp:40:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for(int i=0;i<x.size();i++){
      |                 ~^~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 4548 KB Output is correct
2 Correct 100 ms 4548 KB Output is correct
3 Correct 301 ms 4548 KB Output is correct
4 Correct 89 ms 4548 KB Output is correct
5 Correct 89 ms 4548 KB Output is correct
6 Correct 101 ms 4548 KB Output is correct
7 Correct 80 ms 4548 KB Output is correct
8 Correct 95 ms 4456 KB Output is correct
9 Correct 91 ms 4548 KB Output is correct
10 Correct 99 ms 4548 KB Output is correct
11 Correct 92 ms 4548 KB Output is correct
12 Correct 96 ms 4548 KB Output is correct
13 Correct 90 ms 4548 KB Output is correct
14 Correct 98 ms 4548 KB Output is correct
15 Correct 91 ms 4548 KB Output is correct
16 Correct 98 ms 4540 KB Output is correct
17 Correct 91 ms 4548 KB Output is correct
18 Correct 312 ms 4548 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 4548 KB Output is correct
2 Correct 100 ms 4548 KB Output is correct
3 Correct 301 ms 4548 KB Output is correct
4 Correct 89 ms 4548 KB Output is correct
5 Correct 89 ms 4548 KB Output is correct
6 Correct 101 ms 4548 KB Output is correct
7 Correct 80 ms 4548 KB Output is correct
8 Correct 95 ms 4456 KB Output is correct
9 Correct 91 ms 4548 KB Output is correct
10 Correct 99 ms 4548 KB Output is correct
11 Correct 92 ms 4548 KB Output is correct
12 Correct 96 ms 4548 KB Output is correct
13 Correct 90 ms 4548 KB Output is correct
14 Correct 98 ms 4548 KB Output is correct
15 Correct 91 ms 4548 KB Output is correct
16 Correct 98 ms 4540 KB Output is correct
17 Correct 91 ms 4548 KB Output is correct
18 Correct 312 ms 4548 KB Output is correct
19 Execution timed out 7015 ms 5656 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 4548 KB Output is correct
2 Correct 100 ms 4548 KB Output is correct
3 Correct 301 ms 4548 KB Output is correct
4 Correct 89 ms 4548 KB Output is correct
5 Correct 89 ms 4548 KB Output is correct
6 Correct 101 ms 4548 KB Output is correct
7 Correct 80 ms 4548 KB Output is correct
8 Correct 95 ms 4456 KB Output is correct
9 Correct 91 ms 4548 KB Output is correct
10 Correct 99 ms 4548 KB Output is correct
11 Correct 92 ms 4548 KB Output is correct
12 Correct 96 ms 4548 KB Output is correct
13 Correct 90 ms 4548 KB Output is correct
14 Correct 98 ms 4548 KB Output is correct
15 Correct 91 ms 4548 KB Output is correct
16 Correct 98 ms 4540 KB Output is correct
17 Correct 91 ms 4548 KB Output is correct
18 Correct 312 ms 4548 KB Output is correct
19 Correct 141 ms 4544 KB Output is correct
20 Correct 344 ms 4576 KB Output is correct
21 Correct 110 ms 4508 KB Output is correct
22 Correct 90 ms 4532 KB Output is correct
23 Correct 119 ms 4548 KB Output is correct
24 Correct 97 ms 4548 KB Output is correct
25 Correct 110 ms 4548 KB Output is correct
26 Correct 92 ms 4548 KB Output is correct
27 Correct 108 ms 4468 KB Output is correct
28 Correct 102 ms 4548 KB Output is correct
29 Correct 102 ms 4548 KB Output is correct
30 Correct 88 ms 4476 KB Output is correct
31 Correct 138 ms 4544 KB Output is correct
32 Correct 140 ms 4544 KB Output is correct
33 Correct 132 ms 4544 KB Output is correct
34 Correct 117 ms 4544 KB Output is correct
35 Correct 140 ms 4544 KB Output is correct
36 Correct 132 ms 4544 KB Output is correct
37 Correct 138 ms 4544 KB Output is correct
38 Correct 133 ms 4544 KB Output is correct
39 Correct 142 ms 4544 KB Output is correct
40 Correct 136 ms 4544 KB Output is correct
41 Correct 147 ms 4544 KB Output is correct
42 Correct 132 ms 4544 KB Output is correct
43 Correct 130 ms 4544 KB Output is correct
44 Correct 135 ms 4544 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 4548 KB Output is correct
2 Correct 100 ms 4548 KB Output is correct
3 Correct 301 ms 4548 KB Output is correct
4 Correct 89 ms 4548 KB Output is correct
5 Correct 89 ms 4548 KB Output is correct
6 Correct 101 ms 4548 KB Output is correct
7 Correct 80 ms 4548 KB Output is correct
8 Correct 95 ms 4456 KB Output is correct
9 Correct 91 ms 4548 KB Output is correct
10 Correct 99 ms 4548 KB Output is correct
11 Correct 92 ms 4548 KB Output is correct
12 Correct 96 ms 4548 KB Output is correct
13 Correct 90 ms 4548 KB Output is correct
14 Correct 98 ms 4548 KB Output is correct
15 Correct 91 ms 4548 KB Output is correct
16 Correct 98 ms 4540 KB Output is correct
17 Correct 91 ms 4548 KB Output is correct
18 Correct 312 ms 4548 KB Output is correct
19 Execution timed out 7015 ms 5656 KB Time limit exceeded
20 Halted 0 ms 0 KB -