제출 #847476

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
847476		Mr_Ph	Crossing (JOI21_crossing)	C++14	26 / 100	7017 ms	2616 KiB

Main

///Never gonna give you up.
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
const ll mod=(ll)1e9+7;
const ll mod1=998244353;
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
#define int long long
string cross(string a,string b)
{
    string ans;
    for(int i=0; i<a.sz; i++)
    {
        if(a[i]==b[i])
            ans+=a[i];
        else
        {
            set<char>st;
            st.insert('J');
            st.insert('O');
            st.insert('I');
            st.erase(a[i]);
            st.erase(b[i]);
            ans+=*st.begin();
        }
    }
    return ans;
}
void preprocess() {}
void solve()
{
    int n;
    cin>>n;
    string s1,s2,s3;
    cin>>s1>>s2>>s3;
    set<string>st;
    st.insert(s1);
    st.insert(s2);
    st.insert(s3);
    while(true)
    {
        int x=st.sz;
        for(auto i:st)
            for(auto j:st)
                st.insert(cross(i,j));
        if(x==st.sz)
            break;
    }
    int q;
    string t;
    cin>>q>>t;
    if(st.find(t)!=st.end())
    cout<<"Yes"<<endl;
    else
        cout<<"No"<<endl;
    while(q--)
    {
        int l,r;
        char x;
        cin>>l>>r>>x;
        l--,r--;
        for(int i=l; i<=r; i++)
            t[i]=x;
        if(n<=100&&st.find(t)!=st.end())
        cout<<"Yes"<<endl;
        else
            cout<<"No"<<endl;
    }
}
signed main()
{
    // freopen("div7.in","r",stdin);
    //freopen("div7.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    preprocess();
    //bla();
    int t=1;
    //cin>>t;
    while(t--)
        solve();
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'std::string cross(std::string, std::string)':
Main.cpp:26:19: 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]
   26 |     for(int i=0; i<a.sz; i++)
      |                   ^
Main.cpp: In function 'void solve()':
Main.cpp:60:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::set<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         if(x==st.sz)
      |             ^

• Subtask 1: 3 / 3
• Subtask 2: 0 / 23
• Subtask 3: 23 / 23
• Subtask 4: 0 / 51