oj.uz

답안 #167421

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
167421 2019-12-08T13:29:23 Z PedroBigMan Tavan (COCI16_tavan) C++14
80 / 80
 3 ms 380 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
#define si signed
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll N,M,K,X; cin>>N>>M>>K>>X; X--;
    vector<ll> dig;
    while(dig.size()<M)
    {
        ll rest=X%K;
        dig.pb(rest);
        X/=K;
    }
    reverse(dig.begin(),dig.end());
    string str; cin>>str;
    vector<char> chosen;
    vector<char> uk; char curch;
    REP(i,0,M)
    {
        uk.clear();
        REP(j,0,K) {cin>>curch; uk.pb(curch);}
        sort(uk.begin(),uk.end());
        chosen.pb(uk[dig[i]]);
    }
    ll curind=0;
    REP(i,0,N)
    {
        if(str[i]=='#')
        {
            cout<<chosen[curind];
            curind++;
        }
        else
        {
            cout<<str[i];
        }
    }
    cout<<endl;
    return 0;
}

Compilation message

tavan.cpp: In function 'void Out(std::vector<long long int>)':
tavan.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
tavan.cpp:20:29:
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                             ~~~~~~~~~~~~
tavan.cpp:20:25: note: in expansion of macro 'REP'
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                         ^~~
tavan.cpp: In function 'int main()':
tavan.cpp:28:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(dig.size()<M)
           ~~~~~~~~~~^~

Subtask #1
80.0 / 80.0

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