# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
623844 | Iwanttobreakfree | Art Collections (BOI22_art) | C++17 | 1574 ms | 772 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 "art.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
/*vector<int> t={2,1,4,3};
vector<set<int>> s;
/*int publish(vector<int>& a){
int ans=0;
for(int i=0;i<a.size();i++){
for(int j=0;j<i;j++){
if(s[a[i]-1].find(a[j])==s[a[i]-1].end())ans++;
}
}
return ans;
}*/
int query(vector<int>& order,int a,int b){
vector<int> q;
for(int i=a;i<b;i++)q.push_back(order[i]);
return publish(q);
}
void solve(int N) {
vector<int> order;
for(int i=0;i<N;i++)order.push_back(i+1);
for(int i=0;i<N;i++)order.push_back(i+1);
vector<int> ans(N);
vector<pair<int,int>> dif(N);
for(int i=0;i<N;i++){
ans[i]=query(order,i,N+i);
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... |