oj.uz

Submission #1084799

# Submission time Handle Problem Language Result Execution time Memory
1084799 2024-09-07T03:13:11 Z modwwe Traffic (IOI10_traffic) C++17
0 / 100
 13 ms 23896 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#include "traffic.h"
#define int2 long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while(c<'0'||c>'9')
    {
        c=getchar_unlocked();
    }
    while(c>='0'&&c<='9')
    {
        x=(x<<1)+(x<<3)+c-'0';
        c=getchar_unlocked();
    }
    return x;
}

void phongbeo();
const int inf=1e9;
const int mod2=998244353;
const int  mod1=998244353;
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c,d,e;

};

int2 n,m,s1,s2,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,dem4,l,r,mid,l2,r2,center;
int2  i,s10,s12;
int2 kk;
int2 el=29;

vector<int> v[1000001];
 int2 dp[1000001];
 void dfs(int x,int y)
  {
       for(auto f:v[x])
         if(f!=y)
          dfs(f,x),dp[x]+=dp[f];
  }
  void dfs2(int x,int y)
  {int2 s=0;
  int2 ss=0;
       for(auto f:v[x])
       {
            if(f!=y)
            {
                 s=max(s,dp[f]);
            }
       }
       s=max(s,dp[y]-dp[x]);
 if(y!=0)dp[x]=dp[y];
        if(s<s4) s4=s,s5=x;
     for(auto f:v[x])
        if(f!=y)
    dfs2(f,x);
  }

int LocateCentre(int n, int pp[], int S[], int D[])
{
    s4=1e18;
     for(int i=1;i<=n;i++)
       dp[i]==pp[i-1];
         for(int i=1;i<n;i++)
         {
              l=S[i-1];
              r=D[i-1];
              l++;
              r++;
              v[l].pb(r);
               v[r].pb(l);
         }
         dfs(1,0);
         dfs2(1,0);
          return s5-1;
}

Compilation message

traffic.cpp: In function 'void dfs2(int, int)':
traffic.cpp:79:8: warning: unused variable 'ss' [-Wunused-variable]
   79 |   int2 ss=0;
      |        ^~
traffic.cpp: In function 'int LocateCentre(int, int*, int*, int*)':
traffic.cpp:99:13: warning: statement has no effect [-Wunused-value]
   99 |        dp[i]==pp[i-1];
      |        ~~~~~^~~~~~~~~

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 23896 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 23896 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 23896 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 23896 KB Output isn't correct
2 Halted 0 ms 0 KB -