# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
637823 | Cross_Ratio | Capital City (JOI20_capital_city) | C++14 | 275 ms | 30604 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;
vector<vector<int>> adj;
int C[200005];
int ma[200005];
int mi[200005];
int A[200005];
int B[200005];
bool vis[200005];
int DnC(int s, int e, set<int> Col) {
//cout << "DnC : " << s << ' ' << e << '\n';
if(Col.size()==0 || e<=s) return 1e9;
if(s+1==e && Col.find(B[s])!=Col.end()) return 0;
//cout << "Possible Colors : ";
//for(int n : Col) cout << n << ' ';
//cout << '\n';
int mid = (s+e)/2;
int l = mid, r = mid;
int pm = mi[B[mid]], pa = ma[B[mid]];
int val = 1e9;
if(Col.find(B[mid])!=Col.end()) {
set<int> S;
S.insert(B[mid]);
bool isPos = true;
while(pm < l || r < pa) {
while(pm < l) {
l--;
if(Col.find(B[l])==Col.end()) {
isPos = false;
break;
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... |