# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1013553 | amine_aroua | Netrpeljivost (COI23_netrpeljivost) | C++17 | 1157 ms | 524288 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define intt long long
#define pb push_back
int main()
{
int n ;
cin>>n;
vector<vector<int>> mat(n , vector<int>(n));
for(int i = 0 ; i < n ; i++)
{
for(int j = 0 ; j < n ; j++)
{
cin>>mat[i][j];
}
}
vector<int> beg ;
for(int i = 0 ; i < n; i++)
beg.pb(i);
vector<vector<int>> states;
queue<vector<int>> q;
q.push(beg);
map<vector<int> , int> vis;
while (!q.empty())
{
auto cur = q.front();
q.pop();
if(vis[cur])
continue;
states.pb(cur);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |