Submission #1315630

#TimeUsernameProblemLanguageResultExecution timeMemory
1315630rahidilbayramliConnecting Supertrees (IOI20_supertrees)C++20
11 / 100
92 ms22012 KiB
#include<bits/stdc++.h>
#include "supertrees.h"
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define sz(v) (int)(v.size())
#define f first
#define s second
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
int construct(vector<vector<int>>p)
{
    int n = sz(p);
    vector<vector<int>>answer;
    for(int i = 0; i < n; i++)
    {
        vector<int>row;
        for(int j = 0; j < n; j++)
        {
            if(j == i + 1 || j == i - 1)
                row.pb(1);
            else
                row.pb(0);
        }
        answer.pb(row);
    }
    build(answer);
    return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...