# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
714072 | Ahmed57 | Long Mansion (JOI17_long_mansion) | C++14 | 315 ms | 52404 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.
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#include <bits/stdc++.h>
using namespace std;
signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n;
cin>>n;
int arr[n-1];
for(int i= 0;i<n-1;i++){
cin>>arr[i];
}
vector<vector<int>>v;
for(int i = 0;i<n;i++){
int z;cin>>z;
vector<int> tmp;
for(int j= 0;j<z;j++){
int x;cin>>x;
tmp.push_back(x);
}
v.push_back(tmp);
}
int nd[n+1];
for(int i = 0;i<=n;i++)nd[i] = n;
int valr[n];
int vall[n];
for(int i = n-1;i>=1;i--){
for(auto j:v[i]){
nd[j]=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... |