Submission #1285432

#	Time	Username	Problem	Language	Result	Execution time	Memory
1285432		sasde	Construction of Highway (JOI18_construction)	C++20	16 / 100	2095 ms	11232 KiB

construction

#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,a[N],up[N];
vector<int>ver[N];
ii b[N];
struct BIT
{
  int n,z=0;
  vector<int>bit,s;
  BIT(){};
  BIT(int _n):n(_n),bit(n+5,0),s(n+5,0),z(0){};
  void check(int &idx){
    if(s[idx]!=z){
      bit[idx]=0;
      s[idx]=z;
    }
  }
  void update(int idx,int val){
    while(idx<=n){
      check(idx);
      bit[idx]+=val;
      idx+=idx&-idx;
    }
  }
  int get(int idx){
    int res=0;
    while(idx>0){
      check(idx);
      res+=bit[idx];
      idx-=idx&-idx;
    }
    return res;
  }
  void updaterange(int u,int v,int val){
    update(u,val);
    update(v+1,-val);
  }
  int getrange(int u,int v){
    if(v<u)return 0;
    return get(v)-get(u-1);
  }
};
void dfs(int u,int cha){
  for(auto v:ver[u]){
    if(v==cha)continue;
    up[v]=u;
    dfs(v,u);
  }
}
bool M2;
void solve(){
  cin >> node;
  vector<int>nen;
  for(int i=1;i<=node;++i){
    cin >> a[i];
    nen.emb(a[i]);
  }
  sort(all(nen));
  nen.erase(unique(all(nen)),nen.end());
  for(int i=1;i<=node;++i)a[i]=lower_bound(all(nen),a[i])-nen.begin()+1;
  for(int i=1;i<node;++i){
    int u,v;
    cin >> u >> v;
    ver[u].emb(v);
    ver[v].emb(u);
    b[i]={u,v};
  }
  BIT bit(node);
  dfs(1,-1);
  for(int i=1;i<node;++i){
    int u=b[i].fi,v=b[i].se;
    int moc=a[v];
    long long cost=0;
    while(u){
      cost+=bit.get(a[u]-1);
      bit.update(a[u],1);
      a[u]=moc;
      u=up[u];
    }
    cout <<cost<<'\n';
    bit.z++;
  }
}
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;
}

Compilation message (stderr)

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

• Subtask 1: 7 / 7
• Subtask 2: 9 / 9
• Subtask 3: 0 / 84