제출 #636335

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
636335		hy_1	DNA 돌연변이 (IOI21_dna)	C++17	21 / 100	41 ms	3764 KiB

dna

#include "dna.h"
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <cmath>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <unordered_map>
using namespace std;

#define MOD 1000000007
#define all(x) x.begin(),x.end()
#define ios ios_base::sync_with_stdio(0);cin.tie(0);

string s1 , s2;

void init(string a, string b) {
    s1 = a;
    s2  = b;
}

int get_distance(int x, int y) {
    string a,b;
    a= b = "";
    for(int i  =x;  i<=y; i++){
        a += s1[i];
        b += s2[i];
    }
    string e = a;
    string h = b;
    sort(all(e));    
    sort(all(h));
    if(e != h){
        return -1;
    }
    if(a == b){
        return 0;
    }
    if(a.size() == 2){
        return 1;
    }else{
        for(int i =0; i <a.size();  i++){
            if(a[i] == b[i]){
                return 1;
            }
        }
        return 2;
    }
}

// int main(){
//     string a,b; cin >> a >> b;
//     init(a,b);
//     int l,r; cin >> l >> r;
//     cout << get_distance(l,r) << endl;
//     return 0;
// }

컴파일 시 표준 에러 (stderr) 메시지

dna.cpp: In function 'int get_distance(int, int)':
dna.cpp:70:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         for(int i =0; i <a.size();  i++){
      |                       ~~^~~~~~~~~

• Subtask 1: 21 / 21
• Subtask 2: 0 / 22
• Subtask 3: 0 / 13
• Subtask 4: 0 / 28
• Subtask 5: 0 / 16