제출 #316589

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
316589		FatihSolak	고장난 휴대전화기 (COCI14_mobitel)	C++17	50 / 50	1 ms	384 KiB

mobitel

#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
void solve(){
    int arr[10];
    for(int i=1;i<10;i++){
        int a;
        cin >> a;
        arr[a]=i;
    }
    string s;
    cin >> s;
    int last=-1;
    for(int i=0;i<s.length();i++){
        if(s[i]< 'p'){
            if(last == arr[(s[i]-'a')/3+2]){
                cout << "#";
            }
            for(int j=0;j<(s[i]-'a')%3+1;j++){
                cout << arr[(s[i]-'a')/3+2];
            }
            last = arr[(s[i]-'a')/3+2];
        }
        else if(s[i] < 't'){
            if(last == arr[7]){
                cout << "#";
            }
            for(int j=0;j<(s[i]-'p')+1;j++){
                cout << arr[7];
            }
            last = arr[7];
        }
        else if(s[i] < 'w'){
            if(last == arr[8]){
                cout << "#";
            }
            for(int j=0;j<(s[i]-'t')+1;j++){
                cout << arr[8];
            }
            last = arr[8];
        }
        else{
            if(last == arr[9]){
                cout << "#";
            }
            for(int j=0;j<(s[i]-'w')+1;j++){
                cout << arr[9];
            }
            last = arr[9];
        }
    }
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
}

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

mobitel.cpp: In function 'void solve()':
mobitel.cpp:24:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(int i=0;i<s.length();i++){
      |                 ~^~~~~~~~~~~

• Subtask 1: 50 / 50