oj.uz

Submission #933143

# Submission time Handle Problem Language Result Execution time Memory
933143 2024-02-25T07:07:59 Z yeediot Inspections (NOI23_inspections) C++14
11 / 100
 2000 ms 21512 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=2e5+5;
int l[mxn],r[mxn];
vector<pii>qq;
int bit[mxn];
void modify(int p,int v){
    p++;
    for(;p<mxn;p+=p&-p){
        bit[p]+=v;
    }
}
int query(int p){
    int res=0;
    p++;
    for(;p;p-=p&-p){
        res+=bit[p];
    }
    return res;
}

signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n,m,q;
    cin>>n>>m>>q;
    for(int i=1;i<=m;i++){
        cin>>l[i]>>r[i];
    }
    qq.pb({0,0});
    for(int i=1;i<=q;i++){
        int x;
        cin>>x;
        qq.pb({x,i});
    }
    sort(all(qq));
    vector<int>last(n+1,8e18);
    int cur=0;
    for(int i=1;i<=m;i++){
        for(int j=l[i];j<=r[i];j++){
            if(cur-last[j]-1>=qq[0].F){
                int x=lower_bound(all(qq),make_pair(cur-last[j]-1,(int)8e18))-qq.begin();
                modify(0,1);
                modify(x,-1);
                debug(j,qq[x].F,qq[x].S,cur-last[j]-1);
            }
            last[j]=cur;
            cur++;
        }
    }
    vector<int>ans(q);
    for(int i=1;i<=q;i++){
        ans[qq[i].S]=query(i);
    }
    for(int i=1;i<=q;i++){
        cout<<ans[i]<<' ';
    }
    cout<<'\n';
}
 /*
 input:
 
 */

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 2 ms 4752 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 2 ms 4752 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 123 ms 12004 KB Output is correct
14 Correct 44 ms 11472 KB Output is correct
15 Correct 177 ms 11084 KB Output is correct
16 Correct 162 ms 11400 KB Output is correct
17 Correct 54 ms 11920 KB Output is correct
18 Correct 161 ms 11808 KB Output is correct
19 Runtime error 122 ms 21512 KB Execution killed with signal 6
20 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 162 ms 11212 KB Output is correct
4 Execution timed out 2037 ms 11228 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 2 ms 4752 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 123 ms 12004 KB Output is correct
14 Correct 44 ms 11472 KB Output is correct
15 Correct 177 ms 11084 KB Output is correct
16 Correct 162 ms 11400 KB Output is correct
17 Correct 54 ms 11920 KB Output is correct
18 Correct 161 ms 11808 KB Output is correct
19 Runtime error 122 ms 21512 KB Execution killed with signal 6
20 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 2 ms 4752 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 123 ms 12004 KB Output is correct
14 Correct 44 ms 11472 KB Output is correct
15 Correct 177 ms 11084 KB Output is correct
16 Correct 162 ms 11400 KB Output is correct
17 Correct 54 ms 11920 KB Output is correct
18 Correct 161 ms 11808 KB Output is correct
19 Runtime error 122 ms 21512 KB Execution killed with signal 6
20 Halted 0 ms 0 KB -