oj.uz

답안 #846795

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
846795 2023-09-08T12:46:12 Z Abito Crossing (JOI21_crossing) C++17
26 / 100
 7000 ms 5896 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
#define y1 YONE
typedef unsigned long long ull;
using namespace std;
int n,q;
set<string> s;
string cross(string a,string b){
    string c;
    for (int i=0;i<a.size();i++){
        if (a[i]==b[i]){
            c+=a[i];continue;
        }string v="JOI";
        for (int j=0;j<3;j++){
            if (v[j]==a[i] || v[j]==b[i]) continue;
            c+=v[j];
        }
    }return c;
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n;
    string a,b,c;cin>>a>>b>>c,s.ep(a),s.ep(b),s.ep(c);
    while (true){
        set<string> z;
        for (auto u:s){
            for (auto v:s){
                z.ep(cross(u,v));
            }
        }bool ok=false;
        for (auto u:z){
            if (s.count(u)) continue;
            ok=true;
            s.ep(u);
        }if (!ok) break;
    }cin>>q;
    string d;cin>>d;
    if (s.count(d)) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    while (q--){
        int l,r;char x;cin>>l>>r>>x;
        for (int i=l-1;i<r;i++) d[i]=x;
        if (s.count(d)) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
    return 0;
}

Compilation message

Main.cpp: In function 'std::string cross(std::string, std::string)':
Main.cpp:19: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]
   19 |     for (int i=0;i<a.size();i++){
      |                  ~^~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 848 KB Output is correct
2 Correct 36 ms 940 KB Output is correct
3 Correct 44 ms 1104 KB Output is correct
4 Correct 35 ms 848 KB Output is correct
5 Correct 45 ms 848 KB Output is correct
6 Correct 35 ms 856 KB Output is correct
7 Correct 35 ms 848 KB Output is correct
8 Correct 36 ms 856 KB Output is correct
9 Correct 38 ms 972 KB Output is correct
10 Correct 36 ms 848 KB Output is correct
11 Correct 37 ms 848 KB Output is correct
12 Correct 36 ms 848 KB Output is correct
13 Correct 36 ms 848 KB Output is correct
14 Correct 36 ms 848 KB Output is correct
15 Correct 35 ms 848 KB Output is correct
16 Correct 36 ms 860 KB Output is correct
17 Correct 36 ms 848 KB Output is correct
18 Correct 53 ms 1104 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 848 KB Output is correct
2 Correct 36 ms 940 KB Output is correct
3 Correct 44 ms 1104 KB Output is correct
4 Correct 35 ms 848 KB Output is correct
5 Correct 45 ms 848 KB Output is correct
6 Correct 35 ms 856 KB Output is correct
7 Correct 35 ms 848 KB Output is correct
8 Correct 36 ms 856 KB Output is correct
9 Correct 38 ms 972 KB Output is correct
10 Correct 36 ms 848 KB Output is correct
11 Correct 37 ms 848 KB Output is correct
12 Correct 36 ms 848 KB Output is correct
13 Correct 36 ms 848 KB Output is correct
14 Correct 36 ms 848 KB Output is correct
15 Correct 35 ms 848 KB Output is correct
16 Correct 36 ms 860 KB Output is correct
17 Correct 36 ms 848 KB Output is correct
18 Correct 53 ms 1104 KB Output is correct
19 Correct 4467 ms 5896 KB Output is correct
20 Execution timed out 7015 ms 3476 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 848 KB Output is correct
2 Correct 36 ms 940 KB Output is correct
3 Correct 44 ms 1104 KB Output is correct
4 Correct 35 ms 848 KB Output is correct
5 Correct 45 ms 848 KB Output is correct
6 Correct 35 ms 856 KB Output is correct
7 Correct 35 ms 848 KB Output is correct
8 Correct 36 ms 856 KB Output is correct
9 Correct 38 ms 972 KB Output is correct
10 Correct 36 ms 848 KB Output is correct
11 Correct 37 ms 848 KB Output is correct
12 Correct 36 ms 848 KB Output is correct
13 Correct 36 ms 848 KB Output is correct
14 Correct 36 ms 848 KB Output is correct
15 Correct 35 ms 848 KB Output is correct
16 Correct 36 ms 860 KB Output is correct
17 Correct 36 ms 848 KB Output is correct
18 Correct 53 ms 1104 KB Output is correct
19 Correct 38 ms 848 KB Output is correct
20 Correct 48 ms 1104 KB Output is correct
21 Correct 39 ms 856 KB Output is correct
22 Correct 34 ms 2128 KB Output is correct
23 Correct 38 ms 2388 KB Output is correct
24 Correct 38 ms 2332 KB Output is correct
25 Correct 39 ms 2384 KB Output is correct
26 Correct 36 ms 2384 KB Output is correct
27 Correct 38 ms 2384 KB Output is correct
28 Correct 43 ms 2324 KB Output is correct
29 Correct 38 ms 2384 KB Output is correct
30 Correct 35 ms 2648 KB Output is correct
31 Correct 42 ms 2384 KB Output is correct
32 Correct 40 ms 2384 KB Output is correct
33 Correct 42 ms 2548 KB Output is correct
34 Correct 40 ms 2396 KB Output is correct
35 Correct 41 ms 2388 KB Output is correct
36 Correct 40 ms 2484 KB Output is correct
37 Correct 43 ms 2460 KB Output is correct
38 Correct 42 ms 2384 KB Output is correct
39 Correct 41 ms 2384 KB Output is correct
40 Correct 41 ms 2384 KB Output is correct
41 Correct 41 ms 2480 KB Output is correct
42 Correct 40 ms 2384 KB Output is correct
43 Correct 41 ms 2384 KB Output is correct
44 Correct 42 ms 2472 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 848 KB Output is correct
2 Correct 36 ms 940 KB Output is correct
3 Correct 44 ms 1104 KB Output is correct
4 Correct 35 ms 848 KB Output is correct
5 Correct 45 ms 848 KB Output is correct
6 Correct 35 ms 856 KB Output is correct
7 Correct 35 ms 848 KB Output is correct
8 Correct 36 ms 856 KB Output is correct
9 Correct 38 ms 972 KB Output is correct
10 Correct 36 ms 848 KB Output is correct
11 Correct 37 ms 848 KB Output is correct
12 Correct 36 ms 848 KB Output is correct
13 Correct 36 ms 848 KB Output is correct
14 Correct 36 ms 848 KB Output is correct
15 Correct 35 ms 848 KB Output is correct
16 Correct 36 ms 860 KB Output is correct
17 Correct 36 ms 848 KB Output is correct
18 Correct 53 ms 1104 KB Output is correct
19 Correct 4467 ms 5896 KB Output is correct
20 Execution timed out 7015 ms 3476 KB Time limit exceeded
21 Halted 0 ms 0 KB -