oj.uz

답안 #714704

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
714704 2023-03-25T08:10:59 Z Khizri Plahte (COCI17_plahte) C++17
0 / 160
 2000 ms 203812 KB 
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
    if(a>b) swap(a,b);
    if(a==0) return a+b;
    return gcd(b%a,a);
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
bool is_prime(ll n){
    ll k=sqrt(n);

    if(n==2) return true;
    if(n<2||n%2==0||k*k==n) return false;
    for(int i=3;i<=k;i+=2){
        if(n%i==0){
            return false;
        }
    }
    return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=1e6+5,N=1e6+2;
int t=1,n,m,a[mxn],b[mxn],c[mxn],d[mxn],tree[mxn],MOD=1e9+7;
int add(int ind,int val){
    while(ind<=N){
        tree[ind]+=val;
        ind+=(ind&(-ind));
    }
}
int update(int l,int r,int val){
    add(l,val);
    add(r+1,-val);
}
int query(int ind){
    int ans=0;
    while(ind>0){
        ans+=tree[ind];
        ind-=(ind&(-ind));
    }
    return ans;
}
bool f(pair<int,pii>a,pair<int,pii>b){
    if(a.F==b.F){
        return a.S>b.S;
    }
    return a.F<b.F;
}
void solve(){
    cin>>n>>m;
    vector<pair<int,pii>>vt;
    for(int i=1;i<=n;i++){
        cin>>a[i]>>b[i]>>c[i]>>d[i];
        vt.pb({a[i],{MOD,i}});
        vt.pb({c[i],{-MOD,i}});
    }
    for(int i=1;i<=m;i++){
        int x,y,k;
        cin>>x>>y>>k;
        vt.pb({x,{y,k}});
    }
    sort(all(vt),f);
    set<int>ans[n+6];
    set<int>st;
    for(int i=0;i<vt.size();i++){
        if(vt[i].S.F==MOD){
            st.insert(vt[i].S.S);
        }
        else if(vt[i].S.F==-MOD){
            st.erase(vt[i].S.S);
        }
        else{
            int x=vt[i].S.F,k=vt[i].S.S;
            for(int v:st){
                if(b[v]<=x&&x<=d[v]){
                    ans[v].insert(k);
                }
            }
        }
    }
    for(int i=1;i<=n;i++){
        cout<<ans[i].size()<<endl;
    }
}
int main(){
    IOS;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Compilation message

plahte.cpp: In function 'int add(int, int)':
plahte.cpp:50:1: warning: no return statement in function returning non-void [-Wreturn-type]
   50 | }
      | ^
plahte.cpp: In function 'int update(int, int, int)':
plahte.cpp:54:1: warning: no return statement in function returning non-void [-Wreturn-type]
   54 | }
      | ^
plahte.cpp: In function 'void solve()':
plahte.cpp:85:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |     for(int i=0;i<vt.size();i++){
      |                 ~^~~~~~~~~~

Subtask #1
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2077 ms 138612 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2062 ms 191428 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2074 ms 201592 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2076 ms 203812 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2076 ms 189224 KB Time limit exceeded
2 Halted 0 ms 0 KB -