oj.uz

Submission #148283

# Submission time Handle Problem Language Result Execution time Memory
148283 2019-08-31T19:56:33 Z 요까할 로뭘 은명팀 1(#3666, mario05092929) Chessboard Nonogram (FXCUP4_nonogram) C++17
25 / 100
 6 ms 512 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);
    vector <int> b;
    for(int i = 0;i < n;i++)
    {
        int k = 0,cn;
        if(r[i].size() == 0) a[i].push_back(0);
        if(i % 2 == 0)
        {
            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++;
            }
        }
        else
        {
            b.clear();
            for(int j : c[1])
            {
                for(cn = 0;cn < j;k++,cn++)
                {
                    b.push_back(1);
                }
                if(k != n) b.push_back(0);
                k++;
            }
            //for(int j : b) cout << j << " ";
            //cout << '\n';
            if(!b[i]) a[i].push_back(0);
            k = 0;
            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++;
            }
        }
    }
    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 5 ms 424 KB Output is correct
3 Correct 6 ms 512 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 6 ms 384 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 5 ms 424 KB Output is correct
3 Correct 6 ms 512 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Incorrect 6 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -