oj.uz

답안 #225574

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
225574 2020-04-20T21:55:10 Z caoash Detecting Molecules (IOI16_molecules) C++14
9 / 100
 8 ms 512 KB 
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include "molecules.h";

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef pair<int, pi> pii;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

#define fax(i, a) for (int i = 0; i < (a); i++)
#define f0x(i, a, b) for (int i = (a); i < (b); i++)
#define f0xd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define faxd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define memeset memset

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template <class T, int ...Ns> struct BIT {
    T val = 0;
    void upd(T v) { val += v; }
    T query() { return val; }
};
 
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
    BIT<T,Ns...> bit[N + 1];
    template<typename... Args> void upd(int pos, Args... args) {
        for (; pos <= N; pos += (pos&-pos)) bit[pos].upd(args...);
    }
    template<typename... Args> T sum(int r, Args... args) {
        T res = 0; for (; r; r -= (r&-r)) res += bit[r].query(args...); 
        return res;
    }
    template<typename... Args> T query(int l, int r, Args... args) {
        return sum(r,args...)-sum(l-1,args...);
    }
};

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) { 
        re(t); re(ts...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { fax(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { fax(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
        pr(t); pr(ts...); 
    }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void pr(const T& x) { 
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
    }
    
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
    }
    #define dbg(x...) pr("[",#x,"] = ["), pc(x);
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200005;
const ld PI = 4*atan((ld)1);

vi find_subset(int l, int u, vi w){
   vi ret;
   set<pi> sufs;
   vpi vals;
   int N = sz(w);
   fax(i,N){
      vals.pb(mp(w[i], i));
   }
   sort(all(vals));
   int st = -1; int en = -1;
   ll sum = 0;
   sufs.insert(mp(0,N));
   for(int i = N-1; i >= 0; i--){
      sum += vals[i].f;
      sufs.insert(mp(sum, i));
   }
   //dbg(sufs);
   sum = 0;
   auto fst = sufs.lb(mp(l,INT_MIN));
   //dbg(*fst);
   if(fst != sufs.end()){
      //dbg(u,l,sum+fst->f);
      if(sum + fst->f <= u && sum + fst->f >= l){
         st = -1; en = fst->s;
      }
   }
   for(int i = 0; i < N; i++){
     if(vals[i].f > u){
      break;
     }
     else if(vals[i].f >= l && vals[i].f <= u){
      vi ret{vals[i].s};
      return ret;
     }
     sum += w[i];
     if(sum > u){
       break;
     }
     auto best = sufs.lb(mp(l-sum, INT_MIN));
     //dbg(sum, *best);
     if(best != sufs.end()){
      if(best->s > i && sum + best->f <= u && sum + best->f >= l){
         //dbg(sum + best->f);
         st = i;
         en = best->s;
      }
     }
   }
   //dbg(st,en);
   if(st == -1 && en == -1) return ret;
   fax(i,st+1) ret.pb(vals[i].s);
   f0xd(i,en,N) ret.pb(vals[i].s);;
   sort(all(ret));
   return ret;
}

/*
int main(){
   int N,l,r; re(N,l,r);
   vi inp;
   fax(i,N){
      int x; re(x);
      inp.pb(x);
   }
   dbg(find_subset(l,r,inp));
}
*/

Compilation message

molecules.cpp:6:23: warning: extra tokens at end of #include directive
 #include "molecules.h";
                       ^
molecules.cpp: In function 'void io::setIn(std::__cxx11::string)':
molecules.cpp:134:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
molecules.cpp: In function 'void io::setOut(std::__cxx11::string)':
molecules.cpp:135:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 8 ms 512 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 4 ms 384 KB OK (n = 2, answer = YES)
6 Correct 4 ms 256 KB OK (n = 3, answer = YES)
7 Correct 4 ms 256 KB OK (n = 3, answer = YES)
8 Correct 4 ms 256 KB OK (n = 3, answer = YES)
9 Correct 4 ms 384 KB OK (n = 3, answer = YES)
10 Correct 5 ms 256 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 384 KB OK (n = 3, answer = YES)
13 Correct 4 ms 256 KB OK (n = 3, answer = NO)
14 Correct 5 ms 256 KB OK (n = 3, answer = YES)
15 Correct 5 ms 256 KB OK (n = 3, answer = YES)
16 Correct 5 ms 256 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 384 KB OK (n = 100, answer = NO)
19 Correct 4 ms 256 KB OK (n = 100, answer = YES)

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 12, answer = YES)
2 Correct 5 ms 288 KB OK (n = 12, answer = YES)
3 Correct 5 ms 384 KB OK (n = 12, answer = NO)
4 Correct 5 ms 384 KB OK (n = 12, answer = NO)
5 Correct 4 ms 256 KB OK (n = 12, answer = YES)
6 Correct 5 ms 256 KB OK (n = 12, answer = YES)
7 Correct 5 ms 256 KB OK (n = 12, answer = YES)
8 Correct 5 ms 256 KB OK (n = 12, answer = YES)
9 Correct 5 ms 256 KB OK (n = 6, answer = YES)
10 Correct 4 ms 256 KB OK (n = 12, answer = YES)
11 Correct 4 ms 384 KB OK (n = 100, answer = NO)
12 Incorrect 5 ms 256 KB sum of weights should be in [50..51] but it is 33
13 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 8 ms 512 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 4 ms 384 KB OK (n = 2, answer = YES)
6 Correct 4 ms 256 KB OK (n = 3, answer = YES)
7 Correct 4 ms 256 KB OK (n = 3, answer = YES)
8 Correct 4 ms 256 KB OK (n = 3, answer = YES)
9 Correct 4 ms 384 KB OK (n = 3, answer = YES)
10 Correct 5 ms 256 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 384 KB OK (n = 3, answer = YES)
13 Correct 4 ms 256 KB OK (n = 3, answer = NO)
14 Correct 5 ms 256 KB OK (n = 3, answer = YES)
15 Correct 5 ms 256 KB OK (n = 3, answer = YES)
16 Correct 5 ms 256 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 384 KB OK (n = 100, answer = NO)
19 Correct 4 ms 256 KB OK (n = 100, answer = YES)
20 Correct 5 ms 256 KB OK (n = 12, answer = YES)
21 Correct 5 ms 288 KB OK (n = 12, answer = YES)
22 Correct 5 ms 384 KB OK (n = 12, answer = NO)
23 Correct 5 ms 384 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 256 KB OK (n = 12, answer = YES)
26 Correct 5 ms 256 KB OK (n = 12, answer = YES)
27 Correct 5 ms 256 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 256 KB OK (n = 12, answer = YES)
30 Correct 4 ms 384 KB OK (n = 100, answer = NO)
31 Incorrect 5 ms 256 KB sum of weights should be in [50..51] but it is 33
32 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 8 ms 512 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 4 ms 384 KB OK (n = 2, answer = YES)
6 Correct 4 ms 256 KB OK (n = 3, answer = YES)
7 Correct 4 ms 256 KB OK (n = 3, answer = YES)
8 Correct 4 ms 256 KB OK (n = 3, answer = YES)
9 Correct 4 ms 384 KB OK (n = 3, answer = YES)
10 Correct 5 ms 256 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 384 KB OK (n = 3, answer = YES)
13 Correct 4 ms 256 KB OK (n = 3, answer = NO)
14 Correct 5 ms 256 KB OK (n = 3, answer = YES)
15 Correct 5 ms 256 KB OK (n = 3, answer = YES)
16 Correct 5 ms 256 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 384 KB OK (n = 100, answer = NO)
19 Correct 4 ms 256 KB OK (n = 100, answer = YES)
20 Correct 5 ms 256 KB OK (n = 12, answer = YES)
21 Correct 5 ms 288 KB OK (n = 12, answer = YES)
22 Correct 5 ms 384 KB OK (n = 12, answer = NO)
23 Correct 5 ms 384 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 256 KB OK (n = 12, answer = YES)
26 Correct 5 ms 256 KB OK (n = 12, answer = YES)
27 Correct 5 ms 256 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 256 KB OK (n = 12, answer = YES)
30 Correct 4 ms 384 KB OK (n = 100, answer = NO)
31 Incorrect 5 ms 256 KB sum of weights should be in [50..51] but it is 33
32 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 8 ms 512 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 4 ms 384 KB OK (n = 2, answer = YES)
6 Correct 4 ms 256 KB OK (n = 3, answer = YES)
7 Correct 4 ms 256 KB OK (n = 3, answer = YES)
8 Correct 4 ms 256 KB OK (n = 3, answer = YES)
9 Correct 4 ms 384 KB OK (n = 3, answer = YES)
10 Correct 5 ms 256 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 384 KB OK (n = 3, answer = YES)
13 Correct 4 ms 256 KB OK (n = 3, answer = NO)
14 Correct 5 ms 256 KB OK (n = 3, answer = YES)
15 Correct 5 ms 256 KB OK (n = 3, answer = YES)
16 Correct 5 ms 256 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 384 KB OK (n = 100, answer = NO)
19 Correct 4 ms 256 KB OK (n = 100, answer = YES)
20 Correct 5 ms 256 KB OK (n = 12, answer = YES)
21 Correct 5 ms 288 KB OK (n = 12, answer = YES)
22 Correct 5 ms 384 KB OK (n = 12, answer = NO)
23 Correct 5 ms 384 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 256 KB OK (n = 12, answer = YES)
26 Correct 5 ms 256 KB OK (n = 12, answer = YES)
27 Correct 5 ms 256 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 256 KB OK (n = 12, answer = YES)
30 Correct 4 ms 384 KB OK (n = 100, answer = NO)
31 Incorrect 5 ms 256 KB sum of weights should be in [50..51] but it is 33
32 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 8 ms 512 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 4 ms 384 KB OK (n = 2, answer = YES)
6 Correct 4 ms 256 KB OK (n = 3, answer = YES)
7 Correct 4 ms 256 KB OK (n = 3, answer = YES)
8 Correct 4 ms 256 KB OK (n = 3, answer = YES)
9 Correct 4 ms 384 KB OK (n = 3, answer = YES)
10 Correct 5 ms 256 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 384 KB OK (n = 3, answer = YES)
13 Correct 4 ms 256 KB OK (n = 3, answer = NO)
14 Correct 5 ms 256 KB OK (n = 3, answer = YES)
15 Correct 5 ms 256 KB OK (n = 3, answer = YES)
16 Correct 5 ms 256 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 384 KB OK (n = 100, answer = NO)
19 Correct 4 ms 256 KB OK (n = 100, answer = YES)
20 Correct 5 ms 256 KB OK (n = 12, answer = YES)
21 Correct 5 ms 288 KB OK (n = 12, answer = YES)
22 Correct 5 ms 384 KB OK (n = 12, answer = NO)
23 Correct 5 ms 384 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 256 KB OK (n = 12, answer = YES)
26 Correct 5 ms 256 KB OK (n = 12, answer = YES)
27 Correct 5 ms 256 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 256 KB OK (n = 12, answer = YES)
30 Correct 4 ms 384 KB OK (n = 100, answer = NO)
31 Incorrect 5 ms 256 KB sum of weights should be in [50..51] but it is 33
32 Halted 0 ms 0 KB -