Submission #148266

#	Time	Username	Problem	Language	Result	Execution time	Memory
148266		연구맨 (#201)	Chessboard Nonogram (FXCUP4_nonogram)	C++17	25 / 100	6 ms	472 KiB

Main

#include "nonogram.h"
#include <bits/stdc++.h>
using namespace std;

std::vector<std::vector<int>> SolveNonogram(int n, int m, std::vector<std::vector<int>> r, std::vector<std::vector<int>> c) {
    vector<vector<int> > a(n);
    for(int i = 0;i < n;i++)
    {
        int k = 0,cn;
        for(int j : r[i])
        {
            for(cn = 0;cn < j;k++,cn++)
            {
                a[i].push_back(1);
            }
            if(k != m) a[i].push_back(0);
            k++;
        }
        if(i % 2) reverse(a[i].begin(),a[i].end());
    }
    return a;
}

• Subtask 1: 25 / 25
• Subtask 2: 0 / 75