oj.uz

답안 #736682

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
736682 2023-05-06T05:43:22 Z yuhong Crossing (JOI21_crossing) C++17
0 / 100
 78 ms 2536 KB 
#include <bits/stdc++.h> 
 #include<ext/pb_ds/assoc_container.hpp> 
 #include<ext/pb_ds/tree_policy.hpp> 
 using namespace std; 
 using namespace __gnu_pbds; 
 template <typename T> 
 using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>; 
 #define endl '\n' 
 #define ll long long 
 #define pb push_back 
 #define vi vector<int> 
 #define vll vector<long long> 
 #define sz(x) (int)x.size() 
 #define int long long 
 #define all(x) x.begin(),x.end() 
 #define pii pair<int,int> 
 #define piii pair<int,pii> 
 #define rep(i,a,b) for (ll i = a; i<b; i++) 
 #define repo(i,a,b) for (int i = a; i>=b; i--) 
 #define fi first 
 #define se second 
 int dy[8] = {0,  0, 1, -1, 1, -1 , 1, -1}; 
 int dx[8] = {1, -1, 0,  0, 1, -1, -1,  1}; 
 //int dp[100001][100001]; 
 //int arr[100001]; 
 const int MAXN = 2e5 + 10; 
 const int MOD = 1e9+7; 
 const int INF = 1e18; 
 const int LOG = 20; 
 const int MX = 2e5 + 5;
 vector<string> genes;
void solve() {
	//input
  int n;
  cin>>n;
  for(int i =0;i<3;i++){
    string s;
    cin>>s;
    genes.pb(s);
  }
  int q;
  cin>>q;
  string base;
  cin>>base;
  if(find(all(genes),base)!=genes.end()){
    cout<<"Yes"<<endl;
  }else{
    cout<<"No"<<endl;
  }
  for(int i=0;i<q;i++){
    int l,r;
    char c;
    cin>>l>>r>>c;
    l--, r--;
    for(int j =l;j<=r;j++){
      base[j] = c;
    }
    if(find(all(genes),base)!=genes.end()){
      cout<<"Yes"<<endl;
      cout<<base<<endl;
    }else{
      cout<<"No"<<endl;
    }
  }
}
 int32_t main() { 
 ios_base::sync_with_stdio(false); 
 cin.tie(NULL); 
 cout.tie(NULL); 
  int k =1; 
   while(k--){ 
     solve(); 
   } 
   return 0; 
 }

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 2252 KB Output is correct
2 Correct 49 ms 2368 KB Output is correct
3 Correct 78 ms 2260 KB Output is correct
4 Incorrect 48 ms 2536 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 2252 KB Output is correct
2 Correct 49 ms 2368 KB Output is correct
3 Correct 78 ms 2260 KB Output is correct
4 Incorrect 48 ms 2536 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 2252 KB Output is correct
2 Correct 49 ms 2368 KB Output is correct
3 Correct 78 ms 2260 KB Output is correct
4 Incorrect 48 ms 2536 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 2252 KB Output is correct
2 Correct 49 ms 2368 KB Output is correct
3 Correct 78 ms 2260 KB Output is correct
4 Incorrect 48 ms 2536 KB Output isn't correct
5 Halted 0 ms 0 KB -