제출 #973452

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
973452		modwwe	Sjekira (COCI20_sjekira)	C++17	110 / 110	41 ms	15340 KiB

sjekira

#include<bits/stdc++.h>
#define int long long
#define d0 1
#define d1 11
#define d2 101
#define d3 1001
#define d4 10001
#define d5 400001
#define d6 1000001
#define down cout<<'\n';
#define NMT     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define debug(x) cerr<<x<<" ";
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "a"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define sz(s) s.size()
#define pii pair<int,int>
#define checktime   cout << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void bieoiibe();
void de();
template<typename A, typename B>istream& operator>>(istream& in, pair<A, B> &v){in >> v.first >> v.second;return in;}
template<typename A, typename B> ostream& operator<<(ostream& out, const pair<A, B> &v){out << v.first << " " << v.second << " ";return out;}
template < class T > bool minimize(T& a, const T& b){    return b < a ? a = b, 1 : 0;}
template < class T > bool maximize(T& a, const T& b){return a < b ? a = b, 1 : 0;}
mt19937 rd(chrono::high_resolution_clock::now().time_since_epoch().count    ());
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int dx2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dy2[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const int mod2=1e9+7;
const int mod=1073741824;
const int  mod1=998244353;
//struct trie{int ck[2],cnt;}t[10000005];
string x;
struct ib{int a,b;};
struct ic{int a,b,c;};
struct id{int a,b,c,d;};
int minn=1e18,maxx=-1e9;
int n,m,s2,s4,s3,sf,k,s5,l,r,dem=0,res=0,mx;
int  s;
int el=29;
ic ds[d5*2];
int a[2*d5];
vector<ic> v;
main()
{
#ifndef ONLINE_JUDG E
    //fin(task),fou(task);
#endif
NMT
  // modwwe
    bieoiibe(),down

}
void reset(int x){
    ds[x]={x,1,a[x]};
}
int tim(int x)
{
    if(ds[x].a==x) return x;
    ds[x].a=tim(ds[x].a);
    return ds[x].a;
}
void noi(int x,int y)
{
     x=tim(x);y=tim(y);
      if(x!=y)
      {
          if(ds[x].b<ds[y].b) swap(x,y);
          ds[y].a=x;
          ds[x].c=max(ds[x].c,ds[y].c);
     ds[x].b+=ds[y].b;
      }
}
bool cmp(ic a,ic  b)
{
    return a.c<b.c;
}
void bieoiibe()///TR AN GNG
{
    cin>>n;
    for(int i=1; i<=n; ++i)
    {
        cin>>a[i],reset(i);
    }
    for(int i=1;i<n;i++)
    {
        cin>>l>>r;
        v.push_back({l,r,max(a[l],a[r])});
    }
    sort(v.begin(),v.end(),cmp);
    for(int i=0;i<v.size();i++)
    {
        s2=tim(v[i].a);
        s3=tim(v[i].b);
        if(s2!=s3)
        {
            s+=ds[s2].c+ds[s3].c;
            noi(v[i].a,v[i].b);
        }
    }
    cout<<s;

}

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

sjekira.cpp:51:21: warning: extra tokens at end of #ifndef directive
   51 | #ifndef ONLINE_JUDG E
      |                     ^
sjekira.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   49 | main()
      | ^~~~
sjekira.cpp: In function 'void bieoiibe()':
sjekira.cpp:96:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<ic>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 30 / 30
• Subtask 4: 60 / 60