# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145247 | mat_v | Detecting Molecules (IOI16_molecules) | C++14 | 2 ms | 508 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 <cstdio>
#include <vector>
#include <cassert>
#include <bits/stdc++.h>
#include "molecules.h"
#define maxn 200005
#define pb push_back
#define xx first
#define yy second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int n;
ll pref[maxn];
ll suff[maxn];
int a,b;
bool dobar(ll x){
if(x >=a && x<=b)return 1;
return 0;
}
vector<pii>v;
vector<int>uradi(int x, int y){
vector<int>rezz;
for(int i=0; i<x; i++)rezz.pb(v[i].yy);
for(int i=n-1; i>=n-y; i--)rezz.pb(v[i].yy);
return rezz;
}
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
n = w.size();
for(int i=0; i<n; i++)v.pb({w[i], 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... |