oj.uz

답안 #246761

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246761 2020-07-10T06:46:41 Z Vladikus004 Tavan (COCI16_tavan) C++14
80 / 80
 5 ms 384 KB 
#include <bits/stdc++.h>
#define int long long
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;

const int N = 501;
int n, m, k, x;
string s, t[N];
ll pr;

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
    #endif // LOCAL
    cin >> n >> m >> k >> x >> s;
    --x;
    for (int i = 0; i < m; i++) {
        cin >> t[i];
        sort(all(t[i]));
    }
    vector <int> ans;
    for (int i = 0; i < m; i++){
        ll pr = 1;
        for (int j = m - 1; j > i; j--) {
            if (inf / t[j].size() < pr){
                pr = inf;
                break;
            }
            pr *= (int)t[j].size();
        }
        if (pr == inf){
            ans.push_back(0);
            continue;
        }
        for (int j = 0; j < t[i].size(); j++){
            if (x - pr * j < 0){
                ans.push_back(j - 1);
                x -= pr * (j - 1);
                break;
            }
        }
        if (ans.size() == i) {
            ans.push_back(t[i].size() - 1);
            x -= pr * (int)(t[i].size() - 1);
        }
    }
    reverse(all(ans));
//    for (auto u: ans) cout << u << " ";
    int ind = 0;
    for (int i = 0; i < n; i++){
        if (s[i] != '#') {
            cout << s[i];
            continue;
        }
        cout << t[ind++][ans.back()];
        ans.pop_back();
    }
}

Compilation message

tavan.cpp: In function 'int32_t main()':
tavan.cpp:42:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < t[i].size(); j++){
                         ~~^~~~~~~~~~~~~
tavan.cpp:49:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (ans.size() == i) {
             ~~~~~~~~~~~^~~~

Subtask #1
80.0 / 80.0

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