Submission #491235

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
491235	2021-12-01T06:01:25 Z	robell	Kralj (COCI16_kralj)	C++14	56 / 140	429 ms	43320 KB

kralj

/*
Problem: 
Problem Link: 
Notes: 
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef long long ll;
#define pb push_back
#define eb emplace_back
#define countbits __builtin_popcount
#define beg0 __builtin_clz
#define terminal0 __builtin_ctz
#define f first
#define s second
int mod=1e9+7;
inline void rv(int &n){
    n=0;int m=1;char c=getchar();
    if (c=='-'){m=-1; c=getchar();}
    for (;c>47 && c<58;c=getchar()){n=n*(1<<1)+n*(1<<3)+c-48;}
    n*=m;
}
inline void rv(ll &n){
    n=0;int m=1;char c=getchar();
    if (c=='-'){m=-1; c=getchar();}
    for (;c>47 && c<58;c=getchar()){n=n*(1<<1)+n*(1<<3)+c-48;}
    n*=m;
}
inline void rv(double &n){
    n=0;int m=1;char c=getchar();
    if (c=='-'){m=-1; c=getchar();}
    for (;c>47 && c<58;c=getchar()){n=n*(1<<1)+n*(1<<3)+c-48;}
    if (c=='.'){
        double p = 0.1;c=getchar();
        for (;c>47 && c<58;c=getchar()){n+=((c-48)*p);p/=10;}
    }
    n*=m;
}
inline void rv(float &n){
    n=0;int m=1;char c=getchar();
    if (c=='-'){m=-1; c=getchar();}
    for (;c>47 && c<58;c=getchar()){n=n*(1<<1)+n*(1<<3)+c-48;}
    if (c=='.'){
        double p = 0.1;c=getchar();
        for (;c>47 && c<58;c=getchar()){n+=((c-48)*p);p/=10;}
    }
    n*=m;
}
inline void rv(string &w){
    w="";char c=getchar();
    while (c!=' '&&c!='\n'&&c!=EOF){w+=c;c=getchar();}
}
inline void rv(char &c){c=getchar();}
template<typename T, typename ...Types>
void rv(T &n, Types&&... args){rv(n);rv(args...);}
void setIO(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
}
void setIO(string f){
	freopen((f+".in").c_str(),"r",stdin);
	freopen((f+".out").c_str(),"w",stdout);
	setIO();
}
const int MN = 5e5;
int N,a[MN], p[MN], v[MN];
vector<int> l[MN];
multiset<int> str;
bool c[MN];
int main(){
	setIO();rv(N);
    for (int i=0;i<N;i++) rv(a[i]),a[i]--;
    for (int i=0;i<N;i++) rv(p[i]);
    for (int i=0;i<N;i++) rv(v[i]);
    for (int i=0;i<N;i++) l[a[i]].pb(v[i]);
    int ind = 0, d=N, sind = -1, mv = 1e9, col = 0;
    while (d--){
        col+=(l[ind].size()-1);
        if (col<mv){
            mv=col,ind=col;
        }
        ind++;
    }
    d=N+1;ind = (sind+1)%N;int games = 0;
    while (d--){
        for (int j:l[ind]) str.insert(j);
        l[ind].clear();
        if (str.size()>0){
            auto itr = str.upper_bound(p[ind]);
            if (itr==str.end()) str.erase(str.begin());
            else{
                games++;str.erase(itr);
            }
        }
        ind++;ind%=N;
    }
    cout << games << "\n";
}

Compilation message

kralj.cpp: In function 'void setIO(std::string)':
kralj.cpp:65:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |  freopen((f+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
kralj.cpp:66:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |  freopen((f+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

56.0 / 140.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	429 ms	37180 KB	Output is correct
2	Correct	266 ms	36756 KB	Output is correct
3	Correct	315 ms	42552 KB	Output is correct
4	Correct	318 ms	43320 KB	Output is correct
5	Incorrect	191 ms	20636 KB	Output isn't correct
6	Incorrect	162 ms	21060 KB	Output isn't correct
7	Incorrect	210 ms	23880 KB	Output isn't correct
8	Incorrect	198 ms	23496 KB	Output isn't correct
9	Incorrect	223 ms	24452 KB	Output isn't correct
10	Incorrect	171 ms	21892 KB	Output isn't correct