# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1158976 | Tyx2019 | Light Bulbs (EGOI24_lightbulbs) | C++20 | 0 ms | 576 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxN = 105;
int N;
int qrything[maxN][maxN];
void add(int i, int j){
qrything[i][j] = 1;
}
int ask(){
cout << "?\n";
for(int i=1;i<=N;i++){
for(int j=1;j<=N;j++) cout << qrything[i][j];
cout << endl;
}
memset(qrything, 0, sizeof(qrything));
int k;
cin >> k;
return k;
}
vector<int> unfoundrow, unfoundcol;
vector<int> foundrow, foundcol;
int rowguy[maxN];
int colguy[maxN];
void rowfound(int row, int col){
rowguy[row] = col;
auto it = find(unfoundrow.begin(), unfoundrow.end(), row);
unfoundrow.erase(it);
foundrow.push_back(row);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |