# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1002844 | hyakup | MalnaRISC (COI21_malnarisc) | C++17 | 1 ms | 600 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 ll long long
#define bug(x) cout << #x << " " << x << endl;
#define pii pair<int, int>
const int inf = 1e9 + 10;
const int maxn = 100;
queue<pii> fila[maxn];
vector<int> marc( maxn );
int main(){
int n; cin >> n;
for( int i = 1; i < n; i++ ){
for( int j = 1; j <= n - i; j++ ){
fila[i].push({j, j + 1});
}
}
bool ok = true;
queue<vector<pii>> resp;
while( ok ) {
for( int i = 1; i <= n ;i++ ) marc[i] = 0;
ok = false ;
vector<pii> v;
for( int i = 1; i < n; i++ ){
if( !fila[i].empty() && !marc[fila[i].front().first] && !marc[fila[i].front().second] ){
marc[fila[i].front().first] = 1;
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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |