제출 #1229422

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1229422		FIFI_cpp	Coins (LMIO19_monetos)	C++20	0 / 100	9 ms	1904 KiB

monetos

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <fstream>
#include <iterator>
#include <set>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cctype>
#include <string>
#include <cassert>
#include <set>
#include <bitset>
#include <unordered_set>
#include <numeric>

#define all(a) a.begin(), a.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define ppi pair<int,pair<int,int>>
#define int int64_t

using namespace std;
//    /\_/\
//   (= ._.)
//   / >  \>
// encouraging cat
const int INF = 10000000000000000;
//const int mod = 1000000007;
const int mod = 998244353;
const int MAXN = 200005;
//ifstream fin('xor.in');
//ofstream fout('xor.out');
signed main()
{
    int t,n,ka,kb;
    cin >> t >> n >> ka >> kb;
    vector<vector<int>> grid(n, vector<int> (n,0));
    vector<int> line(n,0);
    for (int i = 0;i < n;i++)
    {
        for (int j = 0;j < n;j++)
        {
            cin >> grid[i][j];
            if (grid[i][j] == 0)
            {
                line[i]++;
            }
        }
    }
    int res = 0;
    for (int i = 0;i < n;i++)
    {
        for (int i = n - 1;i >= 1;i--)
        {
            if (line[i] > line[i - 1])
            {
                int ops = (line[i] - line[i - 1] + 1) / 2;
                line[i - 1] += ops;
                line[i] -= ops;
            }
        }
        for (int i = 0;i < n - 1;i++)
        {
            if (line[i] > n)
            {
                line[i + 1] += line[i] - n;
                line[i] = n;
            }
        }
    }
    vector<vector<int>> ans(n, vector<int> (n,1));
    for (int i = 0;i < n;i++)
    {
        for (int j = 0;j < line[i];j++)
        {
            ans[i][j] = 0;
        }
    }
    for (int i = 0;i < n - 1;i++)
    {
        if (line[i] < line[i + 1])
        {
            assert(false);
        }
    }
    for (int i = 0;i < n;i++)
    {
        for (int j = 0;j < n;j++)
        {
            cout << ans[i][j] << " ";
        }
        cout << '\n';
    }
    return 0;
}

• Subtask 1: 0 / 100