oj.uz

답안 #710928

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710928 2023-03-16T05:30:10 Z EthanKim8683 Plahte (COCI17_plahte) C++17
160 / 160
 207 ms 28564 KB 
#include<bits/stdc++.h>
using namespace std;
using I=int;
const I N=80000;
const I M=80000;
tuple<I,I,I,I>dons[N];
tuple<I,I,I>kims[M];
map<pair<I,I>,I>upps;
vector<tuple<I,I,I>>ques;
set<I>cols[N];
vector<I>adjs[N];
I inds[N];
I ress[N];
void dfs(I a){
  for(auto b:adjs[a]){
    dfs(b);
    if(cols[b].size()>cols[a].size())swap(cols[a],cols[b]);
    for(auto k:cols[b])cols[a].insert(k);
  }
  ress[a]=cols[a].size();
}
I main(){
  cin.tie(0)->sync_with_stdio(0);
  I n,m;cin>>n>>m;
  for(I i=0;i<n;i++){
    I a,b,c,d;cin>>a>>b>>c>>d;
    dons[i]={a,b,c,d};
    ques.push_back({-a,3,i});
    ques.push_back({-c,1,i});
  }
  for(I i=0;i<m;i++){
    I x,y,k;cin>>x>>y>>k;
    kims[i]={x,y,k};
    ques.push_back({-x,2,i});
  }
  sort(ques.begin(),ques.end());
  while(ques.size()){
    auto[cur,t,i]=ques.back();ques.pop_back();
    if(t==3){
      auto[a,b,c,d]=dons[i];
      upps.insert({{d,0},i});
      auto it=upps.upper_bound({d,0});
      if(it==upps.end())continue;
      I j=it->second;
      if(b<get<1>(dons[j]))continue;
      adjs[j].push_back(i),inds[i]++;
      upps.insert({{b,-1},j});
    }
    if(t==2){
      auto[x,y,k]=kims[i];
      auto it=upps.lower_bound({y,0});
      if(it==upps.end())continue;
      I j=it->second;
      if(y<get<1>(dons[j]))continue;
      cols[j].insert(k);
    }
    if(t==1){
      auto[a,b,c,d]=dons[i];
      upps.erase({d,0});
      auto it=upps.upper_bound({d,0});
      if(it==upps.end())continue;
      I j=it->second;
      if(b<get<1>(dons[j]))continue;
      upps.erase({b,-1});
    }
  }
  for(I i=0;i<n;i++)if(!inds[i])dfs(i);
  for(I i=0;i<n;i++)printf("%i\n",ress[i]);
}

Subtask #1
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 10596 KB Output is correct
2 Correct 66 ms 11220 KB Output is correct
3 Correct 3 ms 5972 KB Output is correct

Subtask #2
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 13352 KB Output is correct
2 Correct 68 ms 11384 KB Output is correct
3 Correct 4 ms 5972 KB Output is correct

Subtask #3
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 20204 KB Output is correct
2 Correct 125 ms 14476 KB Output is correct
3 Correct 3 ms 5972 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 204 ms 28564 KB Output is correct
2 Correct 207 ms 19936 KB Output is correct
3 Correct 3 ms 5972 KB Output is correct

Subtask #5
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 204 ms 25564 KB Output is correct
2 Correct 180 ms 19384 KB Output is correct
3 Correct 3 ms 5972 KB Output is correct