제출 #425618

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
425618		ngrace	Paint By Numbers (IOI16_paint)	C++14	32 / 100	1 ms	280 KiB

paint

#include "paint.h"
#include <vector>
#include <iostream>
#include <utility>
#include <cstdlib>
using namespace std;
#define v vector
#define pii pair<int,int>
#define fi first
#define se second

std::string solve_puzzle(std::string s, std::vector<int> c) {
    int n=s.size();
    int k=c.size();
    string out;

    //assume all .
    for(int i=0;i<n;i++){
        bool isWhite=false;
        bool isBlack=false;

        int l=0;
        int cInd=0;
        while(l<n){
            if(l>i){
                l+=c[cInd];
                cInd++;
                if(cInd==k && l<=n) {
                    isWhite=true;
                    break;
                }
                l++;
            }
            else if(i-l>=c[cInd]){
                l+=c[cInd];
                cInd++;
                if(cInd==k) {
                    isWhite=true;
                    break;
                }
                l++;
            }
            else{
                l=i+1;
            }
        }

        l=0;
        cInd=0;
        while(l<n){
            if(l>i){
                l+=c[cInd];
                cInd++;
                if(cInd==k && l<=n) {
                    isBlack=true;
                    break;
                }
                l++;
            }
            else if(i-l>c[cInd] && cInd!=k-1){
                l+=c[cInd];
                cInd++;
                l++;
            }
            else{
                l=max(l,i-c[cInd]+1);
                l+=c[cInd];
                cInd++;
                if(cInd==k && l<=n) {
                    isBlack=true;
                    break;
                }
                l++;
            }
        }

        if(isWhite&&isBlack) out.push_back('?');
        else if(isWhite) out.push_back('_');
        else out.push_back('X');
    }

    return out;
}

• Subtask 1: 7 / 7
• Subtask 2: 3 / 3
• Subtask 3: 22 / 22
• Subtask 4: 0 / 27
• Subtask 5: 0 / 21
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10