oj.uz

Submission #997801

# Submission time Handle Problem Language Result Execution time Memory
997801 2024-06-12T22:50:13 Z cpdreamer Bliskost (COI23_bliskost) C++17
57 / 100
 1000 ms 6572 KB 
#include <bits/stdc++.h>
#include <climits>
#include <ext/pb_ds/assoc_container.hpp>
#include <utility>
using namespace __gnu_pbds;
using namespace std;

typedef tree<int,null_type,less<int>,rb_tree_tag,
        tree_order_statistics_node_update> indexed_set;
const int max_n=INT_MAX;
typedef long long  ll;
#define LLM LONG_LONG_MAX
#define pb push_back
#define F first
#define P pair
#define L length()
#define all(v) v.begin(),v.end()
#define V vector
#define S second
const long long MOD = 99824433; // 1e9 + 7

void file(){
    freopen("input.txt.txt","r",stdin);
    freopen("output.txt.txt","w",stdout);
}
void setio(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct project{
    int start;
    int end;
    int v;
};
bool sorted(project a,project b){
    return a.end<b.end;
}
void check(string s,string t,int n){
    for(int i=0;i<n-1;i++){
        int index_s=int(s[i])-int('a');
        int index_s_1=int(s[i+1])-int('a');
        int index_t=int(t[i])-int('a');
        int diff=index_t-index_s;
        index_s=(index_s+diff+26)%26;
        index_s_1=(index_s_1+diff+26)%26;
        s[i]=char(int('a')+index_s);
        s[i+1]=char(int('a')+index_s_1);
    }
    if(s[n-1]==t[n-1])
        cout<<"da"<<endl;
    else
        cout<<"ne"<<endl;
}
void solve() {
    int n, q;
    cin >> n >> q;
    string s;
    string t;
    cin >> s >> t;
    check(s,t,n);
    while(q--){
        int pos;
        char c;
        cin>>pos>>c;
        s[pos-1]=c;
        check(s,t,n);
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //file();
    solve();
    return 0;
}

Compilation message

Main.cpp: In function 'void file()':
Main.cpp:23:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |     freopen("input.txt.txt","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:24:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |     freopen("output.txt.txt","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void setio(std::string)':
Main.cpp:27:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:28:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 9 ms 4488 KB Output is correct
32 Correct 8 ms 4504 KB Output is correct
33 Correct 8 ms 4524 KB Output is correct
34 Correct 8 ms 4444 KB Output is correct
35 Correct 8 ms 4492 KB Output is correct
36 Correct 9 ms 4852 KB Output is correct
37 Correct 8 ms 4804 KB Output is correct
38 Correct 8 ms 4524 KB Output is correct
39 Correct 10 ms 4856 KB Output is correct
40 Correct 8 ms 4892 KB Output is correct
41 Correct 8 ms 4524 KB Output is correct
42 Correct 9 ms 4492 KB Output is correct
43 Correct 8 ms 4856 KB Output is correct
44 Correct 8 ms 4524 KB Output is correct
45 Correct 9 ms 4516 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 111 ms 596 KB Output is correct
17 Correct 107 ms 920 KB Output is correct
18 Correct 106 ms 996 KB Output is correct
19 Correct 110 ms 1004 KB Output is correct
20 Correct 107 ms 980 KB Output is correct
21 Correct 151 ms 956 KB Output is correct
22 Correct 109 ms 1108 KB Output is correct
23 Correct 104 ms 1112 KB Output is correct
24 Correct 105 ms 1108 KB Output is correct
25 Correct 110 ms 1012 KB Output is correct
26 Correct 104 ms 1104 KB Output is correct
27 Correct 104 ms 900 KB Output is correct
28 Correct 104 ms 956 KB Output is correct
29 Correct 111 ms 1092 KB Output is correct
30 Correct 104 ms 1104 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 111 ms 596 KB Output is correct
32 Correct 107 ms 920 KB Output is correct
33 Correct 106 ms 996 KB Output is correct
34 Correct 110 ms 1004 KB Output is correct
35 Correct 107 ms 980 KB Output is correct
36 Correct 151 ms 956 KB Output is correct
37 Correct 109 ms 1108 KB Output is correct
38 Correct 104 ms 1112 KB Output is correct
39 Correct 105 ms 1108 KB Output is correct
40 Correct 110 ms 1012 KB Output is correct
41 Correct 104 ms 1104 KB Output is correct
42 Correct 104 ms 900 KB Output is correct
43 Correct 104 ms 956 KB Output is correct
44 Correct 111 ms 1092 KB Output is correct
45 Correct 104 ms 1104 KB Output is correct
46 Correct 570 ms 1216 KB Output is correct
47 Correct 534 ms 1112 KB Output is correct
48 Correct 554 ms 1104 KB Output is correct
49 Correct 577 ms 1108 KB Output is correct
50 Correct 560 ms 1092 KB Output is correct
51 Correct 587 ms 1092 KB Output is correct
52 Correct 567 ms 1108 KB Output is correct
53 Correct 549 ms 1108 KB Output is correct
54 Correct 559 ms 1228 KB Output is correct
55 Correct 553 ms 1088 KB Output is correct
56 Correct 549 ms 1104 KB Output is correct
57 Correct 556 ms 1092 KB Output is correct
58 Correct 559 ms 1128 KB Output is correct
59 Correct 547 ms 1148 KB Output is correct
60 Correct 548 ms 1220 KB Output is correct

Subtask #6
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 9 ms 4488 KB Output is correct
32 Correct 8 ms 4504 KB Output is correct
33 Correct 8 ms 4524 KB Output is correct
34 Correct 8 ms 4444 KB Output is correct
35 Correct 8 ms 4492 KB Output is correct
36 Correct 9 ms 4852 KB Output is correct
37 Correct 8 ms 4804 KB Output is correct
38 Correct 8 ms 4524 KB Output is correct
39 Correct 10 ms 4856 KB Output is correct
40 Correct 8 ms 4892 KB Output is correct
41 Correct 8 ms 4524 KB Output is correct
42 Correct 9 ms 4492 KB Output is correct
43 Correct 8 ms 4856 KB Output is correct
44 Correct 8 ms 4524 KB Output is correct
45 Correct 9 ms 4516 KB Output is correct
46 Correct 111 ms 596 KB Output is correct
47 Correct 107 ms 920 KB Output is correct
48 Correct 106 ms 996 KB Output is correct
49 Correct 110 ms 1004 KB Output is correct
50 Correct 107 ms 980 KB Output is correct
51 Correct 151 ms 956 KB Output is correct
52 Correct 109 ms 1108 KB Output is correct
53 Correct 104 ms 1112 KB Output is correct
54 Correct 105 ms 1108 KB Output is correct
55 Correct 110 ms 1012 KB Output is correct
56 Correct 104 ms 1104 KB Output is correct
57 Correct 104 ms 900 KB Output is correct
58 Correct 104 ms 956 KB Output is correct
59 Correct 111 ms 1092 KB Output is correct
60 Correct 104 ms 1104 KB Output is correct
61 Correct 570 ms 1216 KB Output is correct
62 Correct 534 ms 1112 KB Output is correct
63 Correct 554 ms 1104 KB Output is correct
64 Correct 577 ms 1108 KB Output is correct
65 Correct 560 ms 1092 KB Output is correct
66 Correct 587 ms 1092 KB Output is correct
67 Correct 567 ms 1108 KB Output is correct
68 Correct 549 ms 1108 KB Output is correct
69 Correct 559 ms 1228 KB Output is correct
70 Correct 553 ms 1088 KB Output is correct
71 Correct 549 ms 1104 KB Output is correct
72 Correct 556 ms 1092 KB Output is correct
73 Correct 559 ms 1128 KB Output is correct
74 Correct 547 ms 1148 KB Output is correct
75 Correct 548 ms 1220 KB Output is correct
76 Execution timed out 1059 ms 6572 KB Time limit exceeded
77 Halted 0 ms 0 KB -