# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
251903 | jhnah917 | Alternating Current (BOI18_alternating) | C++14 | 195 ms | 2176 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>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
using namespace std;
typedef long long ll;
struct Info{
int s, e, x;
Info() : Info(0, 0, 0) {}
Info(int s, int e, int x) : s(s), e(e), x(x) {}
bool operator < (const Info &t) const {
if(s != t.s) return s < t.s;
if(e != t.e) return e > t.e;
return x < t.x;
}
};
int n, m;
Info a[101010];
int ans[101010];
bool chk[101010][2];
void naive(){
for(int bit=0; bit<(1 << m); bit++){
memset(chk, 0, sizeof chk);
for(int i=1; i<=m; i++){
int j = i-1;
# | 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... |