제출 #1279663

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1279663		sasde	Unique Cities (JOI19_ho_t5)	C++20	4 / 100	2096 ms	33216 KiB

joi2019_ho_t5

#include<bits/stdc++.h>
using namespace std;
bool M1;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time   cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=1e6+5,lg=30,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
 return u+rd()%(v-u+1);
}
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,1,-1,1,-1};
int node,query,m,edge,up[N][lg+5],h[N],c[N],M[N],dem[N];
vector<int>ver[N];
void addedge(int u,int v){
    ver[u].emb(v);
    ver[v].emb(u);
}

void dfs(int u,int cha)
{
    for(auto v:ver[u])
    {
        if(v==cha)continue;
        up[v][0]=u;
        h[v]=h[u]+1;
        dfs(v,u);
    }
}

int lca(int u,int v)
{
    if(h[u]<h[v])swap(u,v);
    for(int j=lg;j>=0;--j)
       {
        if(h[u]-h[v]>=(1<<j))
            u=up[u][j];
       }
     if(u==v)return u;
     for(int j=lg;j>=0;--j)
     {
        if(up[u][j]!=up[v][j])
        {
            u=up[u][j];
            v=up[v][j];
        }
     }
    return up[u][0];
}

void build(){
    dfs(1,-1);
    for(int j=1;j<=lg;++j)
    for(int i=1;i<=node;++i)up[i][j]=up[up[i][j-1]][j-1];
}


bool M2;
void solve(){
    cin >> node >> m;
    for(int i=1;i<node;++i){
        int u,v;
        cin >> u >> v;
        addedge(u,v);
    }
    build();
    for(int i=1;i<=node;++i)cin >> c[i];
    for(int i=1;i<=node;++i){
        int ans=0;
        for(int j=0;j<=node;++j){
            M[j]=dem[j]=0;
        }
        for(int j=1;j<=node;++j){
            if(i!=j){
                int kc=h[i]+h[j]-2*h[lca(i,j)];
                if(!M[kc]){
                    M[kc]=j;
                    if(dem[c[j]]==0)++ans;
                    dem[c[j]]++;
                }
                else{
                    if(M[kc]!=-1){
                        dem[c[M[kc]]]--;
                        if(!dem[c[M[kc]]])--ans;
                        M[kc]=-1;
                    }
                }
            }
        }
        cout << ans<<"\n";
    }
}
main()
{
  srand(time(0));
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    #define task "aws"
    if(fopen(task".inp","r")){
      freopen(task".inp","r",stdin);
      freopen(task".out","w",stdout);
    }
    int t=1;
 //   cin >> t;
while(t--){
    solve();
}
look_memory;
look_time;
}

컴파일 시 표준 에러 (stderr) 메시지

joi2019_ho_t5.cpp:111:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  111 | main()
      | ^~~~
joi2019_ho_t5.cpp: In function 'int main()':
joi2019_ho_t5.cpp:119:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  119 |       freopen(task".inp","r",stdin);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:120:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  120 |       freopen(task".out","w",stdout);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 0 / 32
• Subtask 3: 0 / 32
• Subtask 4: 0 / 32