oj.uz

Submission #16785

# Submission time Handle Problem Language Result Execution time Memory
16785 2015-09-29T04:31:20 Z kdh9949 생일수 I (GA4_birthday1) C++
14 / 100
 135 ms 13300 KB 
#include <stdio.h>
#include <queue>
using namespace std;

struct mindol{
    int three,five,eight;
    bool operator<(const mindol &a)const{
        int digit=three+five+eight;
        int adigit=a.three+a.five+a.eight;
        if(digit==adigit){
            if(three==a.three){
                return five<a.five;
            }
            return three<a.three;
        }
        return digit<adigit;
    }
}ans[1000010];

queue<mindol> q;

void init(){
    for(int i=0;i<=1000000;i++)ans[i]={98769876,98769876,98769876};
    q.push({0,0,0});
    mindol cur;
    int sum;
    while(!q.empty()){
        cur=q.front();
        sum=cur.three*3+cur.five*5+cur.eight*8;
        q.pop();
        if(!(cur<ans[sum]))continue;
        ans[sum]=cur;
        q.push({cur.three+1,cur.five,cur.eight});
        q.push({cur.three,cur.five+1,cur.eight});
        q.push({cur.three,cur.five,cur.eight+1});
    }
}

int main()
{
    init();
    int t,n;
    scanf("%d",&t);
    for(int i=0;i<t;i++){
        scanf("%d",&n);
        if(ans[n].three==98769876){puts("-1");continue;}
        for(int j=0;j<ans[n].three;j++)putchar('3');
        for(int j=0;j<ans[n].five;j++)putchar('5');
        for(int j=0;j<ans[n].eight;j++)putchar('8');
        putchar('\n');
    }
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 13300 KB Output is correct

Subtask #2
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 13300 KB Output isn't correct

Subtask #3
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 13300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 41.0

# Verdict Execution time Memory Grader output
1 Incorrect 135 ms 13300 KB Output isn't correct
2 Halted 0 ms 0 KB -