oj.uz

Submission #148266

# Submission time Handle Problem Language Result Execution time Memory
148266 2019-08-31T19:17:54 Z 연구맨(#3667, foja001) Chessboard Nonogram (FXCUP4_nonogram) C++17
25 / 100
 6 ms 472 KB 
#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.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 472 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 408 KB Output is correct

Subtask #2
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 472 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 408 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 5 ms 408 KB Output is correct
8 Incorrect 5 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -