Even Grid

input/code.cpp: In function 'void solve()':
input/code.cpp:99:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     for (int i = 0; i < res.size(); i++)
      |                     ~~^~~~~~~~~~~~
input/code.cpp:101:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |         for (int j = 0; j < res[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <array>
#include <string>
#include <algorithm>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <queue>
#include <climits>
#include <cmath>
#include <functional>
#include <type_traits>
#include <fstream>
#include <bitset>
#include <complex>
#include <iomanip>
#include <bits/stdc++.h>
 
#include <ext/pb_ds/assoc_container.hpp> // gcc only
template<typename T>
using ordered_set = __gnu_pbds::tree<T, __gnu_pbds::null_type, std::less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;
 
#define int long long
using namespace std;
 
int p(int base, int power, int mod)
{
    if (power == 0)
        return 1;
    if (power % 2 == 0)
    {
        int r = p(base, power/2, mod);
        return (r*r) % mod;
    }
    else
        return (p(base, power-1, mod)*base) % mod;
}
 
int LCM(int a, int b)
{
    return (a / __gcd(a, b)) * b;
}
 
int mod = 1e9+7;
 
 
void solve()
{
    int n;
    cin >> n;

    vector<vector<int>> res(n, vector<int>(n, 0));

    vector<int> probs;
    vector<int> rows;

    string s;
    cin >> s;
    for (int i = 0; i < n; i++)
    {
        res[0][i] = s[i]-'0';
        if (i != 0 && s[i] != '0')
        {
            probs.push_back(i);
        }

    }
    for (int i = 1; i < n; i++)
    {
        string row;
        cin >> row;
        res[i][0] = row[0]-'0';
        if (row[0] != '0')
        {
            rows.push_back(i);
        }
    }

    while(!rows.empty() && !probs.empty())
    {
        res[rows.back()][probs.back()] = 1;
        rows.pop_back();
        probs.pop_back();
    }
    while (!rows.empty())
    {
        res[rows.back()][1] = res[rows.back()][1] ? 0 : 1;
        rows.pop_back();
    }
    while (!probs.empty())
    {
        res[1][probs.back()] = res[1][probs.back()] ? 0 : 1;
        probs.pop_back();
    }


    for (int i = 0; i < res.size(); i++)
    {
        for (int j = 0; j < res[i].size(); j++)
        {
            cout << res[i][j];
        }
        cout << '\n';
    }

    
} 
 
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
 
    int t = 1;
 
    //cin >> t;
 
    for (int i = 0; i < t; i++)
    {
        solve();
        //cout.flush();
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED