oj.uz

답안 #1112517

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112517 2024-11-14T09:23:01 Z vjudge1 Bliskost (COI23_bliskost) C++17
0 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define nmod(a, b) (((a%b)+b)%b) // stands for [n]atural [mod], as in "will always return a natural number", should be used in case of negative
#define a2b(a, b) (a << b) // a*2^b
#define bit(a, b) ((a >> b) & 1) // bth bit from the right, starts at zero
using namespace std;
template<class T> using vec = vector<T>;

const int INFTY = (1LL << 63) - 1;
const int NNFTY = 1LL << 63;

bool sim(string s1, string s2) {
    int n = s1.size();
    if (n != s2.size()) return false;
    int lastdiff = 0;
    for (int i = 0; i < n - 1; i++) {
        lastdiff = s1[i] - s2[i] - lastdiff;
        if (i == n - 2 && lastdiff != s1[n - 1] - s2[n - 1]) return false;
    }
    return true;
}

int32_t main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n, q; cin >> n >> q;
    string s1, s2; cin >> s1 >> s2;
    cout << "ne\n\0da\n" + 4*sim(s1, s2);
    while (q--) {
        int i; char c; cin >> i >> c; i--;
        s1[i] = c;
        cout << "ne\n\0da\n" + 4*sim(s1, s2);
    }
}

Compilation message

Main.cpp:10:31: warning: integer overflow in expression of type 'long long int' results in '9223372036854775807' [-Woverflow]
   10 | const int INFTY = (1LL << 63) - 1;
      |                   ~~~~~~~~~~~~^~~
Main.cpp: In function 'bool sim(std::string, std::string)':
Main.cpp:15:11: 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]
   15 |     if (n != s2.size()) return false;
      |         ~~^~~~~~~~~~~~

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -