oj.uz

Submission #998152

# Submission time Handle Problem Language Result Execution time Memory
998152 2024-06-13T10:43:53 Z cpdreamer Bliskost (COI23_bliskost) C++17
100 / 100
 151 ms 13740 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;
}
int char_diff(char a,char b){
    int index_a=int(a)-int('a');
    int index_b=int(b)-int('a');
    int diff=(index_b-index_a+26)%26;
    return diff;
}
void solve() {
    int n,q;
    cin>>n>>q;
    string s;
    cin>>s;
    string t;
    cin>>t;
    int sign[n];
    int value[n];
    sign[n-1]=1;
    for(int i=n-2;i>=0;i--){
        sign[i]=-1*sign[i+1];
    }
    int c=0;
    for(int i=0;i<n;i++){
        value[i]=char_diff(s[i],t[i]);
        c+=value[i]*sign[i];
    }
    c=c%26;
    if(c==0)
        cout<<"da"<<'\n';
    else
        cout<<"ne"<<'\n';
    while(q--){
        int pos;
        char ch;
        cin>>pos>>ch;
        pos--;
        s[pos]=ch;
        c-=value[pos]*sign[pos];
        value[pos]=char_diff(s[pos],t[pos]);
        c+=value[pos]*sign[pos];
        c=c%26;
        if(c==0)
            cout<<"da"<<'\n';
        else
            cout<<"ne"<<'\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 0 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 0 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 1 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 0 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 0 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 0 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 1 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 0 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 0 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 10 ms 10124 KB Output is correct
32 Correct 9 ms 10120 KB Output is correct
33 Correct 9 ms 10244 KB Output is correct
34 Correct 10 ms 10140 KB Output is correct
35 Correct 9 ms 10124 KB Output is correct
36 Correct 12 ms 10740 KB Output is correct
37 Correct 9 ms 10740 KB Output is correct
38 Correct 9 ms 10140 KB Output is correct
39 Correct 9 ms 10748 KB Output is correct
40 Correct 9 ms 10732 KB Output is correct
41 Correct 10 ms 10136 KB Output is correct
42 Correct 9 ms 10124 KB Output is correct
43 Correct 9 ms 10744 KB Output is correct
44 Correct 10 ms 10156 KB Output is correct
45 Correct 11 ms 10136 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 0 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 8 ms 604 KB Output is correct
17 Correct 10 ms 604 KB Output is correct
18 Correct 8 ms 604 KB Output is correct
19 Correct 8 ms 604 KB Output is correct
20 Correct 9 ms 656 KB Output is correct
21 Correct 8 ms 532 KB Output is correct
22 Correct 11 ms 604 KB Output is correct
23 Correct 9 ms 668 KB Output is correct
24 Correct 8 ms 604 KB Output is correct
25 Correct 10 ms 576 KB Output is correct
26 Correct 9 ms 604 KB Output is correct
27 Correct 12 ms 604 KB Output is correct
28 Correct 8 ms 604 KB Output is correct
29 Correct 8 ms 720 KB Output is correct
30 Correct 8 ms 604 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 0 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 1 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 0 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 0 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 8 ms 604 KB Output is correct
32 Correct 10 ms 604 KB Output is correct
33 Correct 8 ms 604 KB Output is correct
34 Correct 8 ms 604 KB Output is correct
35 Correct 9 ms 656 KB Output is correct
36 Correct 8 ms 532 KB Output is correct
37 Correct 11 ms 604 KB Output is correct
38 Correct 9 ms 668 KB Output is correct
39 Correct 8 ms 604 KB Output is correct
40 Correct 10 ms 576 KB Output is correct
41 Correct 9 ms 604 KB Output is correct
42 Correct 12 ms 604 KB Output is correct
43 Correct 8 ms 604 KB Output is correct
44 Correct 8 ms 720 KB Output is correct
45 Correct 8 ms 604 KB Output is correct
46 Correct 9 ms 604 KB Output is correct
47 Correct 11 ms 600 KB Output is correct
48 Correct 9 ms 604 KB Output is correct
49 Correct 11 ms 604 KB Output is correct
50 Correct 9 ms 604 KB Output is correct
51 Correct 9 ms 600 KB Output is correct
52 Correct 9 ms 600 KB Output is correct
53 Correct 9 ms 604 KB Output is correct
54 Correct 10 ms 600 KB Output is correct
55 Correct 11 ms 604 KB Output is correct
56 Correct 10 ms 604 KB Output is correct
57 Correct 9 ms 720 KB Output is correct
58 Correct 9 ms 604 KB Output is correct
59 Correct 9 ms 604 KB Output is correct
60 Correct 9 ms 604 KB Output is correct

Subtask #6
43.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 0 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 1 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 0 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 0 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 10 ms 10124 KB Output is correct
32 Correct 9 ms 10120 KB Output is correct
33 Correct 9 ms 10244 KB Output is correct
34 Correct 10 ms 10140 KB Output is correct
35 Correct 9 ms 10124 KB Output is correct
36 Correct 12 ms 10740 KB Output is correct
37 Correct 9 ms 10740 KB Output is correct
38 Correct 9 ms 10140 KB Output is correct
39 Correct 9 ms 10748 KB Output is correct
40 Correct 9 ms 10732 KB Output is correct
41 Correct 10 ms 10136 KB Output is correct
42 Correct 9 ms 10124 KB Output is correct
43 Correct 9 ms 10744 KB Output is correct
44 Correct 10 ms 10156 KB Output is correct
45 Correct 11 ms 10136 KB Output is correct
46 Correct 8 ms 604 KB Output is correct
47 Correct 10 ms 604 KB Output is correct
48 Correct 8 ms 604 KB Output is correct
49 Correct 8 ms 604 KB Output is correct
50 Correct 9 ms 656 KB Output is correct
51 Correct 8 ms 532 KB Output is correct
52 Correct 11 ms 604 KB Output is correct
53 Correct 9 ms 668 KB Output is correct
54 Correct 8 ms 604 KB Output is correct
55 Correct 10 ms 576 KB Output is correct
56 Correct 9 ms 604 KB Output is correct
57 Correct 12 ms 604 KB Output is correct
58 Correct 8 ms 604 KB Output is correct
59 Correct 8 ms 720 KB Output is correct
60 Correct 8 ms 604 KB Output is correct
61 Correct 9 ms 604 KB Output is correct
62 Correct 11 ms 600 KB Output is correct
63 Correct 9 ms 604 KB Output is correct
64 Correct 11 ms 604 KB Output is correct
65 Correct 9 ms 604 KB Output is correct
66 Correct 9 ms 600 KB Output is correct
67 Correct 9 ms 600 KB Output is correct
68 Correct 9 ms 604 KB Output is correct
69 Correct 10 ms 600 KB Output is correct
70 Correct 11 ms 604 KB Output is correct
71 Correct 10 ms 604 KB Output is correct
72 Correct 9 ms 720 KB Output is correct
73 Correct 9 ms 604 KB Output is correct
74 Correct 9 ms 604 KB Output is correct
75 Correct 9 ms 604 KB Output is correct
76 Correct 134 ms 13180 KB Output is correct
77 Correct 132 ms 13532 KB Output is correct
78 Correct 151 ms 13300 KB Output is correct
79 Correct 138 ms 13324 KB Output is correct
80 Correct 137 ms 13172 KB Output is correct
81 Correct 142 ms 13364 KB Output is correct
82 Correct 139 ms 13192 KB Output is correct
83 Correct 143 ms 13200 KB Output is correct
84 Correct 134 ms 13184 KB Output is correct
85 Correct 138 ms 13308 KB Output is correct
86 Correct 139 ms 13608 KB Output is correct
87 Correct 132 ms 13740 KB Output is correct
88 Correct 136 ms 13548 KB Output is correct
89 Correct 145 ms 13176 KB Output is correct
90 Correct 139 ms 13596 KB Output is correct