oj.uz

답안 #369680

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
369680 2021-02-22T08:05:46 Z Atill83 Bridž (COCI17_bridz) C++14
50 / 50
 1 ms 396 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
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;
ll n;
int val[300];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n;

    val['A'] = 4;
    val['K'] = 3;
    val['Q'] = 2;
    val['J'] = 1;
    val['X'] = 0;

    int sum = 0;
    for(int i = 0; i < n; i++){
        string s;
        cin>>s;
        for(char j: s)
            sum += val[j];
    }
    cout<<sum<<endl;

    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Compilation message

bridz.cpp: In function 'int main()':
bridz.cpp:38:24: warning: array subscript has type 'char' [-Wchar-subscripts]
   38 |             sum += val[j];
      |                        ^

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 396 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct