| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 621294 | 2022-08-03T16:44:45 Z | IWTIM | Detecting Molecules (IOI16_molecules) | C++14 | 57 ms | 8868 KB |
#include "molecules.h"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
vi e; void init(int N) { e = vi(N,-1); }
int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
bool sameSet(int a, int b) { return get(a) == get(b); }
int size(int x) { return -e[get(x)]; }
bool unite(int x, int y) { // union by size
x = get(x), y = get(y); if (x == y) return 0;
if (e[x] > e[y]) swap(x,y);
e[x] += e[y]; e[y] = x; return 1;
}
};
/*
inline namespace Helpers {
//////////// is_iterable
// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
// this gets used only when we can call begin() and end() on that type
tcT, class = void> struct is_iterable : false_type {};
tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
decltype(end(declval<T>()))
>
> : true_type {};
tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
//////////// is_readable
tcT, class = void> struct is_readable : false_type {};
tcT> struct is_readable<T,
typename std::enable_if_t<
is_same_v<decltype(cin >> declval<T&>()), istream&>
>
> : true_type {};
tcT> constexpr bool is_readable_v = is_readable<T>::value;
//////////// is_printable
// // https://nafe.es/posts/2020-02-29-is-printable/
tcT, class = void> struct is_printable : false_type {};
tcT> struct is_printable<T,
typename std::enable_if_t<
is_same_v<decltype(cout << declval<T>()), ostream&>
>
> : true_type {};
tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
#define f first
#define s second
#define pii pair <int, int>
#define pb push_back
const int N = 3e5 + 5;
int n,l,r;
vector <int> fnd_subset(int l, int r, vector <int> w) {
n = w.size();
vector <pii> v;
for (int i = 0; i < (int)w.size(); i++) {
v.pb({w[i], i});
}
sort(all(v));
vector <int> ans;
if (v[0].f > r) return ans;
long long sum = 0;
for (int i = 0; i < (int)v.size(); i++) {
sum += v[i].f;
ans.pb(v[i].s);
if (sum >= l && sum <= r) {
return ans;
}
}
ans.clear();
if (sum < l) {
return ans;
}
sum = 0;
int idx = 0;
//deque < pii > curans;
for (int i = 0; i < (int)v.size(); i++) {
if (sum + v[i].f >= l) break;
sum += v[i].f;
idx = i;
//curans.pb({v[i].f, v[i].s});
}
int st = -1;
for (int i = idx + 1; i < (int)v.size(); i++) {
sum += v[i].f;
sum -= v[i - idx - 1].f;
if (sum >= l) {
st = i - idx;
break;
}
}
if (st == -1) return ans;
for (int i = st; i <= st + idx; i++) {
ans.pb(v[i].s);
}
return ans;
}
std::vector<int> find_subset(int ll, int rr, std::vector<int> w) {
n = w.size();
l = ll;
r = rr;
vector < int > v(n,0);
for (int i = 0; i < n; i++) {
v[i] = w[i];
}
v = fnd_subset(l,r,v);
sort(v.begin(),v.end());
return v;
}
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 212 KB | OK (n = 1, answer = NO) |
| 2 | Correct | 0 ms | 212 KB | OK (n = 1, answer = NO) |
| 3 | Correct | 1 ms | 212 KB | OK (n = 1, answer = YES) |
| 4 | Correct | 1 ms | 212 KB | OK (n = 2, answer = YES) |
| 5 | Correct | 0 ms | 212 KB | OK (n = 2, answer = YES) |
| 6 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 7 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 8 | Correct | 0 ms | 308 KB | OK (n = 3, answer = YES) |
| 9 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 10 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 11 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 12 | Correct | 0 ms | 212 KB | OK (n = 3, answer = YES) |
| 13 | Correct | 0 ms | 304 KB | OK (n = 3, answer = NO) |
| 14 | Correct | 0 ms | 308 KB | OK (n = 3, answer = YES) |
| 15 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 16 | Correct | 0 ms | 212 KB | OK (n = 3, answer = NO) |
| 17 | Correct | 0 ms | 212 KB | OK (n = 3, answer = NO) |
| 18 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 19 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 2 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 3 | Correct | 0 ms | 212 KB | OK (n = 12, answer = NO) |
| 4 | Correct | 0 ms | 308 KB | OK (n = 12, answer = NO) |
| 5 | Correct | 0 ms | 312 KB | OK (n = 12, answer = YES) |
| 6 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 7 | Correct | 1 ms | 212 KB | OK (n = 12, answer = YES) |
| 8 | Correct | 0 ms | 308 KB | OK (n = 12, answer = YES) |
| 9 | Correct | 1 ms | 212 KB | OK (n = 6, answer = YES) |
| 10 | Correct | 1 ms | 212 KB | OK (n = 12, answer = YES) |
| 11 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 12 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 13 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 14 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 15 | Correct | 1 ms | 304 KB | OK (n = 100, answer = YES) |
| 16 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 17 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 212 KB | OK (n = 1, answer = NO) |
| 2 | Correct | 0 ms | 212 KB | OK (n = 1, answer = NO) |
| 3 | Correct | 1 ms | 212 KB | OK (n = 1, answer = YES) |
| 4 | Correct | 1 ms | 212 KB | OK (n = 2, answer = YES) |
| 5 | Correct | 0 ms | 212 KB | OK (n = 2, answer = YES) |
| 6 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 7 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 8 | Correct | 0 ms | 308 KB | OK (n = 3, answer = YES) |
| 9 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 10 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 11 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 12 | Correct | 0 ms | 212 KB | OK (n = 3, answer = YES) |
| 13 | Correct | 0 ms | 304 KB | OK (n = 3, answer = NO) |
| 14 | Correct | 0 ms | 308 KB | OK (n = 3, answer = YES) |
| 15 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 16 | Correct | 0 ms | 212 KB | OK (n = 3, answer = NO) |
| 17 | Correct | 0 ms | 212 KB | OK (n = 3, answer = NO) |
| 18 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 19 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 20 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 21 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 22 | Correct | 0 ms | 212 KB | OK (n = 12, answer = NO) |
| 23 | Correct | 0 ms | 308 KB | OK (n = 12, answer = NO) |
| 24 | Correct | 0 ms | 312 KB | OK (n = 12, answer = YES) |
| 25 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 26 | Correct | 1 ms | 212 KB | OK (n = 12, answer = YES) |
| 27 | Correct | 0 ms | 308 KB | OK (n = 12, answer = YES) |
| 28 | Correct | 1 ms | 212 KB | OK (n = 6, answer = YES) |
| 29 | Correct | 1 ms | 212 KB | OK (n = 12, answer = YES) |
| 30 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 31 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 32 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 33 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 34 | Correct | 1 ms | 304 KB | OK (n = 100, answer = YES) |
| 35 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 36 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 37 | Correct | 1 ms | 304 KB | OK (n = 28, answer = YES) |
| 38 | Correct | 0 ms | 212 KB | OK (n = 27, answer = YES) |
| 39 | Correct | 0 ms | 212 KB | OK (n = 90, answer = YES) |
| 40 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 41 | Correct | 1 ms | 312 KB | OK (n = 100, answer = YES) |
| 42 | Correct | 1 ms | 308 KB | OK (n = 10, answer = YES) |
| 43 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 44 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 45 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 46 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 47 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 48 | Correct | 0 ms | 212 KB | OK (n = 100, answer = NO) |
| 49 | Correct | 0 ms | 212 KB | OK (n = 100, answer = NO) |
| 50 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 51 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 52 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 53 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 54 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 212 KB | OK (n = 1, answer = NO) |
| 2 | Correct | 0 ms | 212 KB | OK (n = 1, answer = NO) |
| 3 | Correct | 1 ms | 212 KB | OK (n = 1, answer = YES) |
| 4 | Correct | 1 ms | 212 KB | OK (n = 2, answer = YES) |
| 5 | Correct | 0 ms | 212 KB | OK (n = 2, answer = YES) |
| 6 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 7 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 8 | Correct | 0 ms | 308 KB | OK (n = 3, answer = YES) |
| 9 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 10 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 11 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 12 | Correct | 0 ms | 212 KB | OK (n = 3, answer = YES) |
| 13 | Correct | 0 ms | 304 KB | OK (n = 3, answer = NO) |
| 14 | Correct | 0 ms | 308 KB | OK (n = 3, answer = YES) |
| 15 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 16 | Correct | 0 ms | 212 KB | OK (n = 3, answer = NO) |
| 17 | Correct | 0 ms | 212 KB | OK (n = 3, answer = NO) |
| 18 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 19 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 20 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 21 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 22 | Correct | 0 ms | 212 KB | OK (n = 12, answer = NO) |
| 23 | Correct | 0 ms | 308 KB | OK (n = 12, answer = NO) |
| 24 | Correct | 0 ms | 312 KB | OK (n = 12, answer = YES) |
| 25 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 26 | Correct | 1 ms | 212 KB | OK (n = 12, answer = YES) |
| 27 | Correct | 0 ms | 308 KB | OK (n = 12, answer = YES) |
| 28 | Correct | 1 ms | 212 KB | OK (n = 6, answer = YES) |
| 29 | Correct | 1 ms | 212 KB | OK (n = 12, answer = YES) |
| 30 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 31 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 32 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 33 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 34 | Correct | 1 ms | 304 KB | OK (n = 100, answer = YES) |
| 35 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 36 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 37 | Correct | 1 ms | 304 KB | OK (n = 28, answer = YES) |
| 38 | Correct | 0 ms | 212 KB | OK (n = 27, answer = YES) |
| 39 | Correct | 0 ms | 212 KB | OK (n = 90, answer = YES) |
| 40 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 41 | Correct | 1 ms | 312 KB | OK (n = 100, answer = YES) |
| 42 | Correct | 1 ms | 308 KB | OK (n = 10, answer = YES) |
| 43 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 44 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 45 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 46 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 47 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 48 | Correct | 0 ms | 212 KB | OK (n = 100, answer = NO) |
| 49 | Correct | 0 ms | 212 KB | OK (n = 100, answer = NO) |
| 50 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 51 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 52 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 53 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 54 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 55 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = YES) |
| 56 | Correct | 2 ms | 700 KB | OK (n = 10000, answer = YES) |
| 57 | Correct | 3 ms | 724 KB | OK (n = 10000, answer = YES) |
| 58 | Correct | 3 ms | 644 KB | OK (n = 10000, answer = YES) |
| 59 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = YES) |
| 60 | Correct | 2 ms | 652 KB | OK (n = 10000, answer = YES) |
| 61 | Correct | 2 ms | 644 KB | OK (n = 10000, answer = NO) |
| 62 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 63 | Correct | 3 ms | 724 KB | OK (n = 10000, answer = NO) |
| 64 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = YES) |
| 65 | Correct | 4 ms | 596 KB | OK (n = 10000, answer = YES) |
| 66 | Correct | 2 ms | 632 KB | OK (n = 10000, answer = YES) |
| 67 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = YES) |
| 68 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 69 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 70 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 71 | Correct | 2 ms | 660 KB | OK (n = 10000, answer = YES) |
| 72 | Correct | 1 ms | 340 KB | OK (n = 865, answer = YES) |
| 73 | Correct | 1 ms | 300 KB | OK (n = 820, answer = YES) |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 212 KB | OK (n = 1, answer = NO) |
| 2 | Correct | 0 ms | 212 KB | OK (n = 1, answer = NO) |
| 3 | Correct | 1 ms | 212 KB | OK (n = 1, answer = YES) |
| 4 | Correct | 1 ms | 212 KB | OK (n = 2, answer = YES) |
| 5 | Correct | 0 ms | 212 KB | OK (n = 2, answer = YES) |
| 6 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 7 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 8 | Correct | 0 ms | 308 KB | OK (n = 3, answer = YES) |
| 9 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 10 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 11 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 12 | Correct | 0 ms | 212 KB | OK (n = 3, answer = YES) |
| 13 | Correct | 0 ms | 304 KB | OK (n = 3, answer = NO) |
| 14 | Correct | 0 ms | 308 KB | OK (n = 3, answer = YES) |
| 15 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 16 | Correct | 0 ms | 212 KB | OK (n = 3, answer = NO) |
| 17 | Correct | 0 ms | 212 KB | OK (n = 3, answer = NO) |
| 18 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 19 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 20 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 21 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 22 | Correct | 0 ms | 212 KB | OK (n = 12, answer = NO) |
| 23 | Correct | 0 ms | 308 KB | OK (n = 12, answer = NO) |
| 24 | Correct | 0 ms | 312 KB | OK (n = 12, answer = YES) |
| 25 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 26 | Correct | 1 ms | 212 KB | OK (n = 12, answer = YES) |
| 27 | Correct | 0 ms | 308 KB | OK (n = 12, answer = YES) |
| 28 | Correct | 1 ms | 212 KB | OK (n = 6, answer = YES) |
| 29 | Correct | 1 ms | 212 KB | OK (n = 12, answer = YES) |
| 30 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 31 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 32 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 33 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 34 | Correct | 1 ms | 304 KB | OK (n = 100, answer = YES) |
| 35 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 36 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 37 | Correct | 1 ms | 304 KB | OK (n = 28, answer = YES) |
| 38 | Correct | 0 ms | 212 KB | OK (n = 27, answer = YES) |
| 39 | Correct | 0 ms | 212 KB | OK (n = 90, answer = YES) |
| 40 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 41 | Correct | 1 ms | 312 KB | OK (n = 100, answer = YES) |
| 42 | Correct | 1 ms | 308 KB | OK (n = 10, answer = YES) |
| 43 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 44 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 45 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 46 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 47 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 48 | Correct | 0 ms | 212 KB | OK (n = 100, answer = NO) |
| 49 | Correct | 0 ms | 212 KB | OK (n = 100, answer = NO) |
| 50 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 51 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 52 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 53 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 54 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 55 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = YES) |
| 56 | Correct | 2 ms | 700 KB | OK (n = 10000, answer = YES) |
| 57 | Correct | 3 ms | 724 KB | OK (n = 10000, answer = YES) |
| 58 | Correct | 3 ms | 644 KB | OK (n = 10000, answer = YES) |
| 59 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = YES) |
| 60 | Correct | 2 ms | 652 KB | OK (n = 10000, answer = YES) |
| 61 | Correct | 2 ms | 644 KB | OK (n = 10000, answer = NO) |
| 62 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 63 | Correct | 3 ms | 724 KB | OK (n = 10000, answer = NO) |
| 64 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = YES) |
| 65 | Correct | 4 ms | 596 KB | OK (n = 10000, answer = YES) |
| 66 | Correct | 2 ms | 632 KB | OK (n = 10000, answer = YES) |
| 67 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = YES) |
| 68 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 69 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 70 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 71 | Correct | 2 ms | 660 KB | OK (n = 10000, answer = YES) |
| 72 | Correct | 1 ms | 340 KB | OK (n = 865, answer = YES) |
| 73 | Correct | 1 ms | 300 KB | OK (n = 820, answer = YES) |
| 74 | Correct | 2 ms | 468 KB | OK (n = 7500, answer = NO) |
| 75 | Correct | 2 ms | 700 KB | OK (n = 10000, answer = NO) |
| 76 | Correct | 2 ms | 692 KB | OK (n = 10000, answer = NO) |
| 77 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = NO) |
| 78 | Correct | 2 ms | 700 KB | OK (n = 10000, answer = NO) |
| 79 | Correct | 3 ms | 644 KB | OK (n = 10000, answer = YES) |
| 80 | Correct | 2 ms | 700 KB | OK (n = 10000, answer = YES) |
| 81 | Correct | 2 ms | 696 KB | OK (n = 10000, answer = YES) |
| 82 | Correct | 3 ms | 664 KB | OK (n = 10000, answer = YES) |
| 83 | Correct | 3 ms | 724 KB | OK (n = 10000, answer = NO) |
| 84 | Correct | 3 ms | 644 KB | OK (n = 10000, answer = YES) |
| 85 | Correct | 3 ms | 696 KB | OK (n = 10000, answer = NO) |
| 86 | Correct | 3 ms | 644 KB | OK (n = 10000, answer = YES) |
| 87 | Correct | 4 ms | 636 KB | OK (n = 10000, answer = YES) |
| 88 | Correct | 3 ms | 700 KB | OK (n = 10000, answer = YES) |
| 89 | Correct | 3 ms | 640 KB | OK (n = 10000, answer = YES) |
| 90 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = YES) |
| 91 | Correct | 2 ms | 636 KB | OK (n = 10000, answer = YES) |
| 92 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 93 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 212 KB | OK (n = 1, answer = NO) |
| 2 | Correct | 0 ms | 212 KB | OK (n = 1, answer = NO) |
| 3 | Correct | 1 ms | 212 KB | OK (n = 1, answer = YES) |
| 4 | Correct | 1 ms | 212 KB | OK (n = 2, answer = YES) |
| 5 | Correct | 0 ms | 212 KB | OK (n = 2, answer = YES) |
| 6 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 7 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 8 | Correct | 0 ms | 308 KB | OK (n = 3, answer = YES) |
| 9 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 10 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 11 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 12 | Correct | 0 ms | 212 KB | OK (n = 3, answer = YES) |
| 13 | Correct | 0 ms | 304 KB | OK (n = 3, answer = NO) |
| 14 | Correct | 0 ms | 308 KB | OK (n = 3, answer = YES) |
| 15 | Correct | 1 ms | 308 KB | OK (n = 3, answer = YES) |
| 16 | Correct | 0 ms | 212 KB | OK (n = 3, answer = NO) |
| 17 | Correct | 0 ms | 212 KB | OK (n = 3, answer = NO) |
| 18 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 19 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 20 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 21 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 22 | Correct | 0 ms | 212 KB | OK (n = 12, answer = NO) |
| 23 | Correct | 0 ms | 308 KB | OK (n = 12, answer = NO) |
| 24 | Correct | 0 ms | 312 KB | OK (n = 12, answer = YES) |
| 25 | Correct | 0 ms | 212 KB | OK (n = 12, answer = YES) |
| 26 | Correct | 1 ms | 212 KB | OK (n = 12, answer = YES) |
| 27 | Correct | 0 ms | 308 KB | OK (n = 12, answer = YES) |
| 28 | Correct | 1 ms | 212 KB | OK (n = 6, answer = YES) |
| 29 | Correct | 1 ms | 212 KB | OK (n = 12, answer = YES) |
| 30 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 31 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 32 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 33 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 34 | Correct | 1 ms | 304 KB | OK (n = 100, answer = YES) |
| 35 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 36 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 37 | Correct | 1 ms | 304 KB | OK (n = 28, answer = YES) |
| 38 | Correct | 0 ms | 212 KB | OK (n = 27, answer = YES) |
| 39 | Correct | 0 ms | 212 KB | OK (n = 90, answer = YES) |
| 40 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 41 | Correct | 1 ms | 312 KB | OK (n = 100, answer = YES) |
| 42 | Correct | 1 ms | 308 KB | OK (n = 10, answer = YES) |
| 43 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 44 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 45 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 46 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 47 | Correct | 1 ms | 212 KB | OK (n = 100, answer = NO) |
| 48 | Correct | 0 ms | 212 KB | OK (n = 100, answer = NO) |
| 49 | Correct | 0 ms | 212 KB | OK (n = 100, answer = NO) |
| 50 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 51 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 52 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 53 | Correct | 1 ms | 212 KB | OK (n = 100, answer = YES) |
| 54 | Correct | 0 ms | 212 KB | OK (n = 100, answer = YES) |
| 55 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = YES) |
| 56 | Correct | 2 ms | 700 KB | OK (n = 10000, answer = YES) |
| 57 | Correct | 3 ms | 724 KB | OK (n = 10000, answer = YES) |
| 58 | Correct | 3 ms | 644 KB | OK (n = 10000, answer = YES) |
| 59 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = YES) |
| 60 | Correct | 2 ms | 652 KB | OK (n = 10000, answer = YES) |
| 61 | Correct | 2 ms | 644 KB | OK (n = 10000, answer = NO) |
| 62 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 63 | Correct | 3 ms | 724 KB | OK (n = 10000, answer = NO) |
| 64 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = YES) |
| 65 | Correct | 4 ms | 596 KB | OK (n = 10000, answer = YES) |
| 66 | Correct | 2 ms | 632 KB | OK (n = 10000, answer = YES) |
| 67 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = YES) |
| 68 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 69 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 70 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 71 | Correct | 2 ms | 660 KB | OK (n = 10000, answer = YES) |
| 72 | Correct | 1 ms | 340 KB | OK (n = 865, answer = YES) |
| 73 | Correct | 1 ms | 300 KB | OK (n = 820, answer = YES) |
| 74 | Correct | 2 ms | 468 KB | OK (n = 7500, answer = NO) |
| 75 | Correct | 2 ms | 700 KB | OK (n = 10000, answer = NO) |
| 76 | Correct | 2 ms | 692 KB | OK (n = 10000, answer = NO) |
| 77 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = NO) |
| 78 | Correct | 2 ms | 700 KB | OK (n = 10000, answer = NO) |
| 79 | Correct | 3 ms | 644 KB | OK (n = 10000, answer = YES) |
| 80 | Correct | 2 ms | 700 KB | OK (n = 10000, answer = YES) |
| 81 | Correct | 2 ms | 696 KB | OK (n = 10000, answer = YES) |
| 82 | Correct | 3 ms | 664 KB | OK (n = 10000, answer = YES) |
| 83 | Correct | 3 ms | 724 KB | OK (n = 10000, answer = NO) |
| 84 | Correct | 3 ms | 644 KB | OK (n = 10000, answer = YES) |
| 85 | Correct | 3 ms | 696 KB | OK (n = 10000, answer = NO) |
| 86 | Correct | 3 ms | 644 KB | OK (n = 10000, answer = YES) |
| 87 | Correct | 4 ms | 636 KB | OK (n = 10000, answer = YES) |
| 88 | Correct | 3 ms | 700 KB | OK (n = 10000, answer = YES) |
| 89 | Correct | 3 ms | 640 KB | OK (n = 10000, answer = YES) |
| 90 | Correct | 3 ms | 596 KB | OK (n = 10000, answer = YES) |
| 91 | Correct | 2 ms | 636 KB | OK (n = 10000, answer = YES) |
| 92 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 93 | Correct | 2 ms | 596 KB | OK (n = 10000, answer = YES) |
| 94 | Correct | 0 ms | 212 KB | OK (n = 1, answer = YES) |
| 95 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 96 | Correct | 1 ms | 212 KB | OK (n = 3, answer = NO) |
| 97 | Correct | 1 ms | 212 KB | OK (n = 3, answer = YES) |
| 98 | Correct | 33 ms | 6224 KB | OK (n = 150000, answer = NO) |
| 99 | Correct | 57 ms | 8352 KB | OK (n = 200000, answer = YES) |
| 100 | Correct | 50 ms | 8868 KB | OK (n = 200000, answer = NO) |
| 101 | Correct | 48 ms | 8124 KB | OK (n = 200000, answer = YES) |
| 102 | Correct | 46 ms | 7580 KB | OK (n = 200000, answer = YES) |
| 103 | Correct | 46 ms | 7112 KB | OK (n = 200000, answer = YES) |
| 104 | Correct | 46 ms | 8096 KB | OK (n = 200000, answer = YES) |
| 105 | Correct | 50 ms | 7564 KB | OK (n = 200000, answer = NO) |
| 106 | Correct | 54 ms | 7996 KB | OK (n = 200000, answer = YES) |
| 107 | Correct | 45 ms | 7704 KB | OK (n = 200000, answer = NO) |
| 108 | Correct | 42 ms | 7492 KB | OK (n = 200000, answer = NO) |
| 109 | Correct | 50 ms | 7580 KB | OK (n = 200000, answer = NO) |
| 110 | Correct | 49 ms | 6560 KB | OK (n = 200000, answer = YES) |
| 111 | Correct | 36 ms | 7964 KB | OK (n = 200000, answer = YES) |
| 112 | Correct | 29 ms | 7888 KB | OK (n = 200000, answer = YES) |
| 113 | Correct | 29 ms | 6700 KB | OK (n = 200000, answer = YES) |
| 114 | Correct | 47 ms | 7976 KB | OK (n = 200000, answer = YES) |
| 115 | Correct | 34 ms | 7980 KB | OK (n = 200000, answer = YES) |
| 116 | Correct | 39 ms | 7692 KB | OK (n = 200000, answer = YES) |
| 117 | Correct | 40 ms | 6556 KB | OK (n = 200000, answer = YES) |