제출 #1120927

#제출 시각아이디문제언어결과실행 시간메모리
1120927modwwe우호 조약 체결 (JOI14_friends)C++17
100 / 100
67 ms9912 KiB
#pragma GCC optimize("Ofast,unroll-loops") //#pragma GCC optimize("conserve-stack") #include<bits/stdc++.h> #define int 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 mask(k) (1<<k) #define mp make_pair #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 ll mod2 = 1e9 + 7; const int mod1 = 998244353; const ll base=67; int dx[4] = {1, -1, 0, 0}; int dy[4] = {0, 0, 1, -1}; int add(int x,int y) { if(x+y>=mod2) x-=mod2; if(x+y<0)x+=mod2; return x+y; } 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; }; int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center; int i, s10, s12,k1,k2,k3,s11,t,lim,w,l,r ; int kk; int el = 19; main() { if(fopen(task".inp","r")) { fin(task); fou(task); } NHP /// cin>>s1; // modwwe phongbeo(); // checktime } int c[100001]; bool b[100001]; vector<int> v[100001]; struct skibidi { ib dsu[100001]; void reset() { for(int i=1; i<=n; i++) dsu[i]= {1,i}; } int get(int x) { if(dsu[x].b==x) return x; return dsu[x].b=get(dsu[x].b); } void noi(int x,int y) { x=get(x); y=get(y); if(x==y) return; if(dsu[x].a<dsu[y].a)swap(x,y); dsu[x].a+=dsu[y].a; dsu[y].b=x; } } ds; void phongbeo() { cin>>n>>m; /// kieu ko tim du 2 con thi ko noi dc stack<ib> s; for(int i=1; i<=m; i++) { cin>>l>>r; c[l]++; v[l].pb(r); } for(int i=1; i<=n; i++) if(c[i]>=2) s.push({i,v[i][0]}),b[i]=1; ds.reset(); while(!s.empty()) { ib x=s.top(); s.pop(); int hihi=ds.get(x.a); if(ds.dsu[hihi].a!=1)ds.noi(x.b,x.a); for(auto f:v[x.a]) { ds.noi(f,x.b); if(b[f]&&v[f].size()>0)ds.noi(f,v[f][0]); if(!b[f]) { b[f]=1; s.push({f,ds.get(f)}); } } } for(int i=1; i<=n; i++) { if(ds.dsu[i].b==i) { s4+=ds.dsu[i].a*(ds.dsu[i].a-1); } for(auto x:v[i]) if(ds.get(x)!=ds.get(i)) s4++; } cout<<s4; }

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

friends.cpp:77:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   77 | main()
      | ^~~~
friends.cpp: In function 'int main()':
friends.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
friends.cpp:81:9: note: in expansion of macro 'fin'
   81 |         fin(task);
      |         ^~~
friends.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
friends.cpp:82:9: note: in expansion of macro 'fou'
   82 |         fou(task);
      |         ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...