# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1013464 | amine_aroua | Nestabilnost (COI23_nestabilnost) | C++17 | 100 ms | 18600 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 pb push_back
#define int long long
#define nl '\n'
int n;
vector<int> a , b , f;
vector<map<int ,int>> possible_k;
vector<int> dp;
vector<vector<int>> adj;
vector<int> order;
void dfs(int x , int p)
{
order.pb(x);
for(auto u : adj[x])
{
if(u == p)
continue;
dfs(u , x);
}
}
signed main() {
cin>>n;
a.assign(n , 0);
b = a;
f.assign(n + 1 , 0);
for(int i = 0 ; i < n ; i++)
cin>>b[i];
int mn = 1e9;
for(int i = 1 ; i <= n;i++)
# | 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... |