oj.uz

답안 #492546

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
492546 2021-12-07T20:52:07 Z Carmel_Ab1 Martian DNA (BOI18_dna) C++17
100 / 100
 66 ms 8504 KB 
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t: a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}

vi b,q,t;
int TT,sz=1,inf=1e9;
void update(int i,int v){
    t[i+=sz/2]+=v;
    while(i>1){
        t[i/2]=min(t[i],t[i^1]);
        i/=2;
    }
}
int query(int l,int r){
    int ans=1e9;
    for(l+=sz/2,r+=sz/2 +1; l<r; l/=2,r/=2){
        if(l&1)ans=min(ans,t[l++]);
        if(r&1)ans=min(ans,t[--r]);
    }
    return ans;
}
int MinSub(int N, int K, int T, vi P, vi B, vi Q){
    TT=T;
    b=vi(B);
    q=vi(Q);
    int ans=1e9;
    while(sz<=2*K)
        sz*=2;
    t.resize(sz,0);
    for(int i=0; i<K; i++)
        update(i,inf);
    for(int i=0; i<T; i++)
        update(B[i],-Q[i]-inf);
    for(int i=0,j=0; i<N ; i++){
        while(j<N && query(0,K-1)<0){
            update(P[j],1);
            j++;
        }
        if(0<=query(0,K-1))
            ans=min(ans,j-i);
        update(P[i],-1);
    }
    if(ans==1e9)ans=-1;
    return ans;
}
void solve() {
    int N,K,T;
    cin >> N >> K >> T;
    vi a(N);
    read(a);

    vi B,Q;
    for(int i=0; i<T; i++){
        int x,y;
        cin >> x >> y;
        B.pb(x);
        Q.pb(y);
    }
    int ans= MinSub(N,K,T,a,B,Q);
    if(ans==-1)out("impossible")
    else out(ans)
}

Compilation message

dna.cpp: In function 'void usaco(std::string)':
dna.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
dna.cpp:58:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 312 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2244 KB Output is correct
2 Correct 16 ms 2252 KB Output is correct
3 Correct 18 ms 2252 KB Output is correct
4 Correct 24 ms 2292 KB Output is correct
5 Correct 45 ms 4040 KB Output is correct
6 Correct 16 ms 2240 KB Output is correct
7 Correct 23 ms 2372 KB Output is correct
8 Correct 48 ms 5196 KB Output is correct
9 Correct 30 ms 2832 KB Output is correct
10 Correct 16 ms 2252 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 6784 KB Output is correct
2 Correct 50 ms 5348 KB Output is correct
3 Correct 40 ms 4172 KB Output is correct
4 Correct 13 ms 2244 KB Output is correct
5 Correct 59 ms 7188 KB Output is correct
6 Correct 66 ms 8504 KB Output is correct
7 Correct 32 ms 3100 KB Output is correct
8 Correct 37 ms 3644 KB Output is correct
9 Correct 17 ms 2252 KB Output is correct
10 Correct 14 ms 2252 KB Output is correct
11 Correct 22 ms 2248 KB Output is correct
12 Correct 17 ms 2252 KB Output is correct
13 Correct 42 ms 4032 KB Output is correct
14 Correct 20 ms 2244 KB Output is correct
15 Correct 21 ms 2380 KB Output is correct
16 Correct 47 ms 5196 KB Output is correct
17 Correct 30 ms 2892 KB Output is correct
18 Correct 16 ms 2252 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 396 KB Output is correct
23 Correct 1 ms 324 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct