| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 92653 | SamAnd | Riddick's Cube (IZhO13_riddicks) | C++17 | 6 ms | 504 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 <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
const int N=7,INF=100500;
int ans=INF;
int a[N][N];
int b[N][N];
int c[N][N];
int n,m;
int t[N],s[N];
bool stg()
{
bool z=true,z1=true;
for(int i=0;i<n;++i)
{
for(int j=0;j<m;++j)
{
if(c[i][j]!=c[i][0])
z=false;
}
}
for(int j=0;j<m;++j)
{
for(int i=0;i<n;++i)
{
if(c[i][j]!=c[0][j])
z1=false;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||