oj.uz

답안 #955436

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
955436 2024-03-30T12:35:11 Z shenfe1 IOI 바이러스 (JOI21_fever) C++17
6 / 100
 52 ms 103376 KB 
#include <bits/stdc++.h>

#pragma optimize("Ofast")
#pragma target("avx2")

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
#define int ll

const int MAX=1e6+15;
const int B=300;
const int N=104;
const int block=400;
const int maxB=MAX/B+10;
const ll inf=1e18;  
const int mod=998244353;
const int mod1=1e9+9;
const ld eps=1e-9;

// int dx[8]={1,0,-1,0,1,-1,-1,1};
// int dy[8]={0,1,0,-1,1,-1,1,-1};

int binpow(int a,int n){
  if(!n)return 1;
  if(n%2==1)return a*binpow(a,n-1)%mod;
  int k=binpow(a,n/2);
  return k*k%mod;
}

int n;
pii a[MAX];
int b[MAX];
int d[MAX];
int dx[MAX],dy[MAX];
set<int> vx[MAX],vy[MAX];
int ans;

void calc(int start,int nap){
  b[start]=nap;
  set<pii> st;
  for(int i=1;i<=n;i++)d[i]=inf;
  d[start]=0;
  st.in({0,start});
  while(!st.empty()){
    int v=st.begin()->S;
    st.erase(st.begin());
    vector<int> del;
    for(auto to:vx[dx[v]]){
      if(to==v)continue;
      if(d[to]>abs(a[v].F-a[to].F)&&d[v]<abs(a[v].F-a[to].F)){
        if(b[v]==1){
          if(a[to].F<a[v].F){
            b[to]=2;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});
            del.pb(to);
          }
        }
        if(b[v]==2){
          if(a[to].F>a[v].F){
            b[to]=1;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});
            del.pb(to);
          }
        }
        if(b[v]==3){
          if(a[to].F>a[v].F){
            b[to]=4;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});
            del.pb(to);
          }
        }
        if(b[v]==4){
          if(a[to].F<a[v].F){
            b[to]=3;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});         
            del.pb(to);
          }
        }
      }
    }
    for(int x:del)vx[dx[v]].erase(x);
    del.clear();
    for(auto to:vy[dy[v]]){
      if(to==v)continue;
      if(d[to]>abs(a[v].F-a[to].F)&&d[v]<abs(a[v].F-a[to].F)){
        if(b[v]==1){
          if(a[to].F>a[v].F){
            b[to]=4;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to}); 
            del.pb(to);           
          }
        }
        if(b[v]==2){
          if(a[to].F>a[v].F){
            b[to]=3;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});    
            del.pb(to);        
          }
        }
        if(b[v]==3){
          if(a[to].F<a[v].F){
            b[to]=2;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});   
            del.pb(to); 
          }
        }
        if(b[v]==4){
          if(a[to].F<a[v].F){
            b[to]=1;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});    
            del.pb(to); 
          }
        }
      }    
    }
    for(int x:del)vy[dy[v]].erase(x);
    del.clear();
  }
  int cur=0;
  for(int i=1;i<=n;i++){
    cur+=(d[i]!=inf);
    // cout<<d[i]<<" "<<b[i]<<"\n";
  }
  ans=max(ans,cur);
}

void solve(){
  cin>>n;
  for(int i=1;i<=n;i++)cin>>a[i].F>>a[i].S;
  set<int> d;
  map<int,int> mp;
  int cur=0;

  for(int k=1;k<=4;k++){
    for(int i=1;i<=n;i++){
      d.in(a[i].F+a[i].S);
    }
    for(int x:d)mp[x]=++cur;
    for(int i=1;i<=n;i++){
      dx[i]=mp[a[i].F+a[i].S];
      vx[mp[a[i].F+a[i].S]].in(i);
    }

    cur=0;
    mp.clear();
    d.clear();

    for(int i=1;i<=n;i++){
      d.in(a[i].F-a[i].S);
    }
    for(int x:d)mp[x]=++cur;
    for(int i=1;i<=n;i++){
      dy[i]=mp[a[i].F-a[i].S];
      vy[mp[a[i].F-a[i].S]].in(i);
    }
    cur=0;
    mp.clear();
    d.clear();
    calc(1,k);
  }
  cout<<ans;
}

signed main(){
  //  freopen("help.in","r",stdin);
  //  freopen("help.out","w",stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // prec();
  int t=1;
  // cin>>t;  
  while(t--)solve();
}

Compilation message

fever.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize("Ofast")
      | 
fever.cpp:4: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    4 | #pragma target("avx2")
      |

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 103144 KB Output is correct
2 Correct 22 ms 103376 KB Output is correct
3 Correct 23 ms 103004 KB Output is correct
4 Correct 22 ms 103004 KB Output is correct
5 Correct 21 ms 103000 KB Output is correct
6 Correct 22 ms 103004 KB Output is correct
7 Correct 21 ms 103156 KB Output is correct
8 Correct 21 ms 103004 KB Output is correct
9 Correct 21 ms 103000 KB Output is correct
10 Correct 25 ms 103260 KB Output is correct
11 Correct 21 ms 103260 KB Output is correct
12 Correct 21 ms 103004 KB Output is correct
13 Correct 21 ms 103004 KB Output is correct
14 Correct 22 ms 103140 KB Output is correct
15 Correct 21 ms 103004 KB Output is correct
16 Correct 23 ms 103108 KB Output is correct
17 Correct 21 ms 103004 KB Output is correct
18 Correct 21 ms 103172 KB Output is correct
19 Correct 23 ms 103000 KB Output is correct
20 Correct 22 ms 103004 KB Output is correct
21 Correct 23 ms 103172 KB Output is correct
22 Correct 21 ms 103224 KB Output is correct
23 Correct 21 ms 103004 KB Output is correct
24 Correct 21 ms 103220 KB Output is correct
25 Correct 21 ms 103168 KB Output is correct
26 Correct 21 ms 103004 KB Output is correct
27 Correct 21 ms 103128 KB Output is correct
28 Correct 21 ms 103004 KB Output is correct
29 Correct 22 ms 103128 KB Output is correct
30 Correct 22 ms 103004 KB Output is correct
31 Correct 21 ms 103004 KB Output is correct
32 Incorrect 21 ms 103252 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 103144 KB Output is correct
2 Correct 22 ms 103376 KB Output is correct
3 Correct 23 ms 103004 KB Output is correct
4 Correct 22 ms 103004 KB Output is correct
5 Correct 21 ms 103000 KB Output is correct
6 Correct 22 ms 103004 KB Output is correct
7 Correct 21 ms 103156 KB Output is correct
8 Correct 21 ms 103004 KB Output is correct
9 Correct 21 ms 103000 KB Output is correct
10 Correct 25 ms 103260 KB Output is correct
11 Correct 21 ms 103260 KB Output is correct
12 Correct 21 ms 103004 KB Output is correct
13 Correct 21 ms 103004 KB Output is correct
14 Correct 22 ms 103140 KB Output is correct
15 Correct 21 ms 103004 KB Output is correct
16 Correct 23 ms 103108 KB Output is correct
17 Correct 21 ms 103004 KB Output is correct
18 Correct 21 ms 103172 KB Output is correct
19 Correct 23 ms 103000 KB Output is correct
20 Correct 22 ms 103004 KB Output is correct
21 Correct 23 ms 103172 KB Output is correct
22 Correct 21 ms 103224 KB Output is correct
23 Correct 21 ms 103004 KB Output is correct
24 Correct 21 ms 103220 KB Output is correct
25 Correct 21 ms 103168 KB Output is correct
26 Correct 21 ms 103004 KB Output is correct
27 Correct 21 ms 103128 KB Output is correct
28 Correct 21 ms 103004 KB Output is correct
29 Correct 22 ms 103128 KB Output is correct
30 Correct 22 ms 103004 KB Output is correct
31 Correct 21 ms 103004 KB Output is correct
32 Incorrect 21 ms 103252 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 103000 KB Output is correct
2 Correct 22 ms 103000 KB Output is correct
3 Correct 21 ms 103004 KB Output is correct
4 Correct 21 ms 103004 KB Output is correct
5 Correct 23 ms 103004 KB Output is correct
6 Correct 25 ms 103004 KB Output is correct
7 Correct 21 ms 103120 KB Output is correct
8 Correct 21 ms 103004 KB Output is correct

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 103144 KB Output is correct
2 Correct 22 ms 103376 KB Output is correct
3 Correct 23 ms 103004 KB Output is correct
4 Correct 22 ms 103004 KB Output is correct
5 Correct 21 ms 103000 KB Output is correct
6 Correct 22 ms 103004 KB Output is correct
7 Correct 21 ms 103156 KB Output is correct
8 Correct 21 ms 103004 KB Output is correct
9 Correct 21 ms 103000 KB Output is correct
10 Correct 25 ms 103260 KB Output is correct
11 Correct 21 ms 103260 KB Output is correct
12 Correct 21 ms 103004 KB Output is correct
13 Correct 21 ms 103004 KB Output is correct
14 Correct 22 ms 103140 KB Output is correct
15 Correct 21 ms 103004 KB Output is correct
16 Correct 23 ms 103108 KB Output is correct
17 Correct 21 ms 103004 KB Output is correct
18 Correct 21 ms 103172 KB Output is correct
19 Correct 23 ms 103000 KB Output is correct
20 Correct 22 ms 103004 KB Output is correct
21 Correct 23 ms 103172 KB Output is correct
22 Correct 21 ms 103224 KB Output is correct
23 Correct 21 ms 103004 KB Output is correct
24 Correct 21 ms 103220 KB Output is correct
25 Correct 21 ms 103168 KB Output is correct
26 Correct 21 ms 103004 KB Output is correct
27 Correct 21 ms 103128 KB Output is correct
28 Correct 21 ms 103004 KB Output is correct
29 Correct 22 ms 103128 KB Output is correct
30 Correct 22 ms 103004 KB Output is correct
31 Correct 21 ms 103004 KB Output is correct
32 Incorrect 21 ms 103252 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 103144 KB Output is correct
2 Correct 22 ms 103376 KB Output is correct
3 Correct 23 ms 103004 KB Output is correct
4 Correct 22 ms 103004 KB Output is correct
5 Correct 21 ms 103000 KB Output is correct
6 Correct 22 ms 103004 KB Output is correct
7 Correct 21 ms 103156 KB Output is correct
8 Correct 21 ms 103004 KB Output is correct
9 Correct 21 ms 103000 KB Output is correct
10 Correct 25 ms 103260 KB Output is correct
11 Correct 21 ms 103260 KB Output is correct
12 Correct 21 ms 103004 KB Output is correct
13 Correct 21 ms 103004 KB Output is correct
14 Correct 22 ms 103140 KB Output is correct
15 Correct 21 ms 103004 KB Output is correct
16 Correct 23 ms 103108 KB Output is correct
17 Correct 21 ms 103004 KB Output is correct
18 Correct 21 ms 103172 KB Output is correct
19 Correct 23 ms 103000 KB Output is correct
20 Correct 22 ms 103004 KB Output is correct
21 Correct 23 ms 103172 KB Output is correct
22 Correct 21 ms 103224 KB Output is correct
23 Correct 21 ms 103004 KB Output is correct
24 Correct 21 ms 103220 KB Output is correct
25 Correct 21 ms 103168 KB Output is correct
26 Correct 21 ms 103004 KB Output is correct
27 Correct 21 ms 103128 KB Output is correct
28 Correct 21 ms 103004 KB Output is correct
29 Correct 22 ms 103128 KB Output is correct
30 Correct 22 ms 103004 KB Output is correct
31 Correct 21 ms 103004 KB Output is correct
32 Incorrect 21 ms 103252 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 103144 KB Output is correct
2 Correct 22 ms 103376 KB Output is correct
3 Correct 23 ms 103004 KB Output is correct
4 Correct 22 ms 103004 KB Output is correct
5 Correct 21 ms 103000 KB Output is correct
6 Correct 22 ms 103004 KB Output is correct
7 Correct 21 ms 103156 KB Output is correct
8 Correct 21 ms 103004 KB Output is correct
9 Correct 21 ms 103000 KB Output is correct
10 Correct 25 ms 103260 KB Output is correct
11 Correct 21 ms 103260 KB Output is correct
12 Correct 21 ms 103004 KB Output is correct
13 Correct 21 ms 103004 KB Output is correct
14 Correct 22 ms 103140 KB Output is correct
15 Correct 21 ms 103004 KB Output is correct
16 Correct 23 ms 103108 KB Output is correct
17 Correct 21 ms 103004 KB Output is correct
18 Correct 21 ms 103172 KB Output is correct
19 Correct 23 ms 103000 KB Output is correct
20 Correct 22 ms 103004 KB Output is correct
21 Correct 23 ms 103172 KB Output is correct
22 Correct 21 ms 103224 KB Output is correct
23 Correct 21 ms 103004 KB Output is correct
24 Correct 21 ms 103220 KB Output is correct
25 Correct 21 ms 103168 KB Output is correct
26 Correct 21 ms 103004 KB Output is correct
27 Correct 21 ms 103128 KB Output is correct
28 Correct 21 ms 103004 KB Output is correct
29 Correct 22 ms 103128 KB Output is correct
30 Correct 22 ms 103004 KB Output is correct
31 Correct 21 ms 103004 KB Output is correct
32 Incorrect 21 ms 103252 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 103144 KB Output is correct
2 Correct 22 ms 103376 KB Output is correct
3 Correct 23 ms 103004 KB Output is correct
4 Correct 22 ms 103004 KB Output is correct
5 Correct 21 ms 103000 KB Output is correct
6 Correct 22 ms 103004 KB Output is correct
7 Correct 21 ms 103156 KB Output is correct
8 Correct 21 ms 103004 KB Output is correct
9 Correct 21 ms 103000 KB Output is correct
10 Correct 25 ms 103260 KB Output is correct
11 Correct 21 ms 103260 KB Output is correct
12 Correct 21 ms 103004 KB Output is correct
13 Correct 21 ms 103004 KB Output is correct
14 Correct 22 ms 103140 KB Output is correct
15 Correct 21 ms 103004 KB Output is correct
16 Correct 23 ms 103108 KB Output is correct
17 Correct 21 ms 103004 KB Output is correct
18 Correct 21 ms 103172 KB Output is correct
19 Correct 23 ms 103000 KB Output is correct
20 Correct 22 ms 103004 KB Output is correct
21 Correct 23 ms 103172 KB Output is correct
22 Correct 21 ms 103224 KB Output is correct
23 Correct 21 ms 103004 KB Output is correct
24 Correct 21 ms 103220 KB Output is correct
25 Correct 21 ms 103168 KB Output is correct
26 Correct 21 ms 103004 KB Output is correct
27 Correct 21 ms 103128 KB Output is correct
28 Correct 21 ms 103004 KB Output is correct
29 Correct 22 ms 103128 KB Output is correct
30 Correct 22 ms 103004 KB Output is correct
31 Correct 21 ms 103004 KB Output is correct
32 Incorrect 21 ms 103252 KB Output isn't correct
33 Halted 0 ms 0 KB -