oj.uz

Submission #316589

# Submission time Handle Problem Language Result Execution time Memory
316589 2020-10-26T18:45:46 Z FatihSolak Mobitel (COCI14_mobitel) C++17
50 / 50
 1 ms 384 KB 
#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();
    }
}

Compilation message

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.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct