oj.uz

Submission #47101

# Submission time Handle Problem Language Result Execution time Memory
47101 2018-04-27T15:12:39 Z aquablitz11 Detecting Molecules (IOI16_molecules) C++14
9 / 100
 3 ms 784 KB 
// headers
#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// types
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using dbl = double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using piipi = pair<pii, int>;
using pipii = pair<int, pii>;
using plpii = pair<ll, pii>;
using ppii = pair<pii, pii>;
// loops
#define forx(i, x, y) for (int i = (x); i <= (y); ++i)
#define forn(i, n) for (int i = 0; i < (n); ++i)
#define for1(i, n) for (int i = 1; i <= (n); ++i)
#define rofx(i, x, y) for (int i = x; i >= y; --i)
#define rofn(i, n) for (int i = n-1; i >= 0; --i)
#define rof1(i, n) for (int i = n; i >= 1; --i)
#define fora(x, v) for (auto x : v)
// define shortcuts
#define all(x) begin(x), end(x)
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#define X first
#define Y second
#define MP make_pair
#define MT make_tuple
// functions
template<class T> inline bool hasbit(T x, int i) { return x&(1<<i); }
template<class T> inline T togbit(T x, int i) { return x|(1<<i); }
template<class T> inline T setbit(T x, int i) { return x|(1<<i); }
template<class T> inline T rembit(T x, int i) { return x&~(1<<i); }
template<class T> inline bool setmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool setmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> int compress(vector<T> &v) { sort(all(v)); v.resize(unique(all(v))-v.begin()); return v.size(); }
// read functions
int read_int() { int x; scanf("%d", &x); return x; }
ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
dbl read_dbl() { dbl x; scanf("%lf", &x); return x; }
void _R(int &x) { x = read_int(); }
void _R(ll &x) { x = read_ll(); }
void _R(dbl &x) { x = read_dbl(); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
// print functions
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const ll &x) { printf("%" PRId64, x); }
void _W(const ull &x) { printf("%" PRIu64, x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
// pseudo-random number generator
template<class T, T x1, T x2, T x3, int y1, int y2, int y3>
struct PRNG {
    using S = typename make_signed<T>::type;
    T s;
    PRNG(T _s = 0) : s(_s) {}
    T next() {
        T z = (s += x1);
        z = (z ^ (z >> y1)) * x2;
        z = (z ^ (z >> y2)) * x3;
        return z ^ (z >> y3);
    }
    T next(T n) { return next() % n; }
    S next(S l, S r) { return l + next(r - l + 1); }
    T operator()() { return next(); }
    T operator()(T n) { return next(n); }
    S operator()(S l, S r) { return next(l, r); }
    static T gen(T s) { return PRNG(s)(); }
    template<class U>
    void shuffle(U first, U last) {
        size_t n = last - first;
        for (size_t i = 0; i < n; i++) swap(first[i], first[next(i + 1)]);
    }
};
PRNG<uint32_t, 0x9E3779B1, 0x85EBCA6B, 0xC2B2AE35, 16, 13, 16> r32;
PRNG<uint64_t, 0x9E3779B97F4A7C15, 0xBF58476D1CE4E5B9, 0x94D049BB133111EB, 30, 27, 31> r64;

#include "molecules.h"

vector<int> find_subset(int l, int u, vector<int> w) {

    vector<pii> nw;
    forn(i, w.size())
        nw.eb(w[i], i);
    sort(all(nw));

    ll s = 0;
    bool ok = false;
    vector<int> ans;
    rofn(i, nw.size()) {
        if (s+nw[i].F > u)
            continue;
        s += nw[i].F;
        ans.pb(nw[i].S);
        if (s >= l) {
            ok = true;
            break;
        }
    }

    if (ok)
        return ans;
    return vector<int>();

}

Compilation message

molecules.cpp: In function 'll read_ll()':
molecules.cpp:49:42: warning: format '%ld' expects argument of type 'long int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
 ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
                                        ~~^
molecules.cpp: In function 'ull read_ull()':
molecules.cpp:50:45: warning: format '%lu' expects argument of type 'long unsigned int*', but argument 2 has type 'ull* {aka long long unsigned int*}' [-Wformat=]
 ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
                                           ~~^
molecules.cpp: In function 'void _W(const ll&)':
molecules.cpp:60:44: warning: format '%ld' expects argument of type 'long int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
 void _W(const ll &x) { printf("%" PRId64, x); }
                                           ~^
molecules.cpp: In function 'void _W(const ull&)':
molecules.cpp:61:45: warning: format '%lu' expects argument of type 'long unsigned int', but argument 2 has type 'ull {aka long long unsigned int}' [-Wformat=]
 void _W(const ull &x) { printf("%" PRIu64, x); }
                                            ~^
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:23:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define forn(i, n) for (int i = 0; i < (n); ++i)
                                      ^
molecules.cpp:100:5: note: in expansion of macro 'forn'
     forn(i, w.size())
     ^~~~
molecules.cpp: In function 'int read_int()':
molecules.cpp:48:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 int read_int() { int x; scanf("%d", &x); return x; }
                         ~~~~~^~~~~~~~~~
molecules.cpp: In function 'll read_ll()':
molecules.cpp:49:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
                      ~~~~~^~~~~~~~~~~~~~~~
molecules.cpp: In function 'ull read_ull()':
molecules.cpp:50:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
                         ~~~~~^~~~~~~~~~~~~~~~
molecules.cpp: In function 'dbl read_dbl()':
molecules.cpp:51:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 dbl read_dbl() { dbl x; scanf("%lf", &x); return x; }
                         ~~~~~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 496 KB OK (n = 1, answer = NO)
3 Correct 2 ms 496 KB OK (n = 1, answer = YES)
4 Correct 2 ms 500 KB OK (n = 2, answer = YES)
5 Correct 2 ms 544 KB OK (n = 2, answer = YES)
6 Correct 2 ms 544 KB OK (n = 3, answer = YES)
7 Correct 2 ms 640 KB OK (n = 3, answer = YES)
8 Correct 2 ms 640 KB OK (n = 3, answer = YES)
9 Correct 2 ms 640 KB OK (n = 3, answer = YES)
10 Correct 2 ms 704 KB OK (n = 3, answer = YES)
11 Correct 2 ms 704 KB OK (n = 3, answer = YES)
12 Correct 2 ms 704 KB OK (n = 3, answer = YES)
13 Correct 2 ms 704 KB OK (n = 3, answer = NO)
14 Correct 2 ms 704 KB OK (n = 3, answer = YES)
15 Correct 2 ms 704 KB OK (n = 3, answer = YES)
16 Correct 3 ms 768 KB OK (n = 3, answer = NO)
17 Correct 2 ms 768 KB OK (n = 3, answer = NO)
18 Correct 2 ms 784 KB OK (n = 100, answer = NO)
19 Correct 2 ms 784 KB OK (n = 100, answer = YES)

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 784 KB Contestant can not find answer, jury can
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 496 KB OK (n = 1, answer = NO)
3 Correct 2 ms 496 KB OK (n = 1, answer = YES)
4 Correct 2 ms 500 KB OK (n = 2, answer = YES)
5 Correct 2 ms 544 KB OK (n = 2, answer = YES)
6 Correct 2 ms 544 KB OK (n = 3, answer = YES)
7 Correct 2 ms 640 KB OK (n = 3, answer = YES)
8 Correct 2 ms 640 KB OK (n = 3, answer = YES)
9 Correct 2 ms 640 KB OK (n = 3, answer = YES)
10 Correct 2 ms 704 KB OK (n = 3, answer = YES)
11 Correct 2 ms 704 KB OK (n = 3, answer = YES)
12 Correct 2 ms 704 KB OK (n = 3, answer = YES)
13 Correct 2 ms 704 KB OK (n = 3, answer = NO)
14 Correct 2 ms 704 KB OK (n = 3, answer = YES)
15 Correct 2 ms 704 KB OK (n = 3, answer = YES)
16 Correct 3 ms 768 KB OK (n = 3, answer = NO)
17 Correct 2 ms 768 KB OK (n = 3, answer = NO)
18 Correct 2 ms 784 KB OK (n = 100, answer = NO)
19 Correct 2 ms 784 KB OK (n = 100, answer = YES)
20 Incorrect 2 ms 784 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 496 KB OK (n = 1, answer = NO)
3 Correct 2 ms 496 KB OK (n = 1, answer = YES)
4 Correct 2 ms 500 KB OK (n = 2, answer = YES)
5 Correct 2 ms 544 KB OK (n = 2, answer = YES)
6 Correct 2 ms 544 KB OK (n = 3, answer = YES)
7 Correct 2 ms 640 KB OK (n = 3, answer = YES)
8 Correct 2 ms 640 KB OK (n = 3, answer = YES)
9 Correct 2 ms 640 KB OK (n = 3, answer = YES)
10 Correct 2 ms 704 KB OK (n = 3, answer = YES)
11 Correct 2 ms 704 KB OK (n = 3, answer = YES)
12 Correct 2 ms 704 KB OK (n = 3, answer = YES)
13 Correct 2 ms 704 KB OK (n = 3, answer = NO)
14 Correct 2 ms 704 KB OK (n = 3, answer = YES)
15 Correct 2 ms 704 KB OK (n = 3, answer = YES)
16 Correct 3 ms 768 KB OK (n = 3, answer = NO)
17 Correct 2 ms 768 KB OK (n = 3, answer = NO)
18 Correct 2 ms 784 KB OK (n = 100, answer = NO)
19 Correct 2 ms 784 KB OK (n = 100, answer = YES)
20 Incorrect 2 ms 784 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 496 KB OK (n = 1, answer = NO)
3 Correct 2 ms 496 KB OK (n = 1, answer = YES)
4 Correct 2 ms 500 KB OK (n = 2, answer = YES)
5 Correct 2 ms 544 KB OK (n = 2, answer = YES)
6 Correct 2 ms 544 KB OK (n = 3, answer = YES)
7 Correct 2 ms 640 KB OK (n = 3, answer = YES)
8 Correct 2 ms 640 KB OK (n = 3, answer = YES)
9 Correct 2 ms 640 KB OK (n = 3, answer = YES)
10 Correct 2 ms 704 KB OK (n = 3, answer = YES)
11 Correct 2 ms 704 KB OK (n = 3, answer = YES)
12 Correct 2 ms 704 KB OK (n = 3, answer = YES)
13 Correct 2 ms 704 KB OK (n = 3, answer = NO)
14 Correct 2 ms 704 KB OK (n = 3, answer = YES)
15 Correct 2 ms 704 KB OK (n = 3, answer = YES)
16 Correct 3 ms 768 KB OK (n = 3, answer = NO)
17 Correct 2 ms 768 KB OK (n = 3, answer = NO)
18 Correct 2 ms 784 KB OK (n = 100, answer = NO)
19 Correct 2 ms 784 KB OK (n = 100, answer = YES)
20 Incorrect 2 ms 784 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 496 KB OK (n = 1, answer = NO)
3 Correct 2 ms 496 KB OK (n = 1, answer = YES)
4 Correct 2 ms 500 KB OK (n = 2, answer = YES)
5 Correct 2 ms 544 KB OK (n = 2, answer = YES)
6 Correct 2 ms 544 KB OK (n = 3, answer = YES)
7 Correct 2 ms 640 KB OK (n = 3, answer = YES)
8 Correct 2 ms 640 KB OK (n = 3, answer = YES)
9 Correct 2 ms 640 KB OK (n = 3, answer = YES)
10 Correct 2 ms 704 KB OK (n = 3, answer = YES)
11 Correct 2 ms 704 KB OK (n = 3, answer = YES)
12 Correct 2 ms 704 KB OK (n = 3, answer = YES)
13 Correct 2 ms 704 KB OK (n = 3, answer = NO)
14 Correct 2 ms 704 KB OK (n = 3, answer = YES)
15 Correct 2 ms 704 KB OK (n = 3, answer = YES)
16 Correct 3 ms 768 KB OK (n = 3, answer = NO)
17 Correct 2 ms 768 KB OK (n = 3, answer = NO)
18 Correct 2 ms 784 KB OK (n = 100, answer = NO)
19 Correct 2 ms 784 KB OK (n = 100, answer = YES)
20 Incorrect 2 ms 784 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -