Ruudukko

input/code.cpp: In function 'int main()':
input/code.cpp:66:18: warning: variable 'found' set but not used [-Wunused-but-set-variable]
             bool found = false;
                  ^~~~~
input/code.cpp:83:18: warning: variable 'found' set but not used [-Wunused-but-set-variable]
             bool found = false;
                  ^~~~~

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin >> n;
    int table[n][n] = {0};
    table[0][0] = 1;
    vector<set<int>> columns(n);
    vector<set<int>> rows(n);

    /*
    set<int> full;
    for(int i = 1; i <= n; i++){
        full.insert(i);
    }*/
    /*
    set<int> dummy;
    columns.push_back(dummy);
    rows.push_back(dummy);*/


    for(int x = 0; x < n; x++){
        table[0][x] = x+1;
        set<int> temp;
        temp.insert(x+1);
        columns.push_back(temp);
    }
    for(int y = 0; y < n; y++){
        table[y][0] = y+1;
        set<int> temp;
        temp.insert(y+1);
        rows.push_back(temp);
    }

    /*
    for(int y = 0; y < n; y++){
        for(int x = 0; x < n-y-1; x++){
            set<int> no = rows[y];
            set<int> col = columns[x];
            no.insert(col.begin(), col.end());



            bool found = false;
            for(int i = 1; i <= n; i++){
                if(no.find(i) == no.end()){
                    found = true;
                    rows[y].insert(i);
                    columns[x].insert(i);
                    table[y][x] = i;
                    break;
                }
            }



        }
    }*/

    for(int i = 1; i < n; i++){
        for(int x = 1; x < n; x++){
            set<int> no = rows[i];
            set<int> col = columns[x];
            no.insert(col.begin(), col.end());

            bool found = false;
            for(int i = 1; i <= n; i++){
                if(no.find(i) == no.end()){
                    found = true;
                    rows[i].insert(i);
                    columns[x].insert(i);
                    table[i][x] = i;
                    break;
                }
            }
        }

        for(int y = 1; y < n; y++){
            set<int> no = rows[y];
            set<int> col = columns[i];
            no.insert(col.begin(), col.end());

            bool found = false;
            for(int i = 1; i <= n; i++){
                if(no.find(i) == no.end()){
                    found = true;
                    rows[y].insert(i);
                    columns[i].insert(i);
                    table[y][i] = i;
                    break;
                }
            }
        }
    }

    /*
    for(int y = n-1; y > 0; y--){
        for(int x = n-1; x > n-y-1; x--){
            set<int> no = rows[y];
            set<int> col = columns[x];
            no.insert(col.begin(), col.end());



            bool found = false;
            for(int i = 1; i <= n; i++){
                if(no.find(i) == no.end()){
                    found = true;
                    rows[y].insert(i);
                    columns[x].insert(i);
                    table[y][x] = i;
                    break;
                }
            }



        }
    }

    */

    for(int y = 0; y < n; y++){
        for(int x = 0; x < n; x++){
            cout << table[y][x] << " ";
        }
        cout << endl;
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: RUNTIME ERROR

Test 4

Verdict: RUNTIME ERROR

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: RUNTIME ERROR