結果
問題 | No.2072 Anatomy |
ユーザー | deuteridayo |
提出日時 | 2022-09-17 06:42:05 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 133 ms / 2,000 ms |
コード長 | 2,591 bytes |
コンパイル時間 | 4,069 ms |
コンパイル使用メモリ | 237,896 KB |
実行使用メモリ | 11,136 KB |
最終ジャッジ日時 | 2024-12-22 00:21:53 |
合計ジャッジ時間 | 7,790 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 116 ms
9,904 KB |
testcase_09 | AC | 131 ms
10,624 KB |
testcase_10 | AC | 121 ms
8,320 KB |
testcase_11 | AC | 123 ms
10,084 KB |
testcase_12 | AC | 97 ms
7,936 KB |
testcase_13 | AC | 129 ms
10,880 KB |
testcase_14 | AC | 83 ms
7,424 KB |
testcase_15 | AC | 80 ms
8,064 KB |
testcase_16 | AC | 132 ms
10,752 KB |
testcase_17 | AC | 127 ms
10,684 KB |
testcase_18 | AC | 65 ms
7,296 KB |
testcase_19 | AC | 132 ms
11,008 KB |
testcase_20 | AC | 133 ms
11,136 KB |
testcase_21 | AC | 132 ms
10,980 KB |
testcase_22 | AC | 132 ms
11,128 KB |
testcase_23 | AC | 130 ms
11,008 KB |
testcase_24 | AC | 129 ms
11,008 KB |
testcase_25 | AC | 133 ms
11,136 KB |
testcase_26 | AC | 2 ms
5,248 KB |
testcase_27 | AC | 130 ms
11,008 KB |
testcase_28 | AC | 130 ms
11,100 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> using namespace std; using namespace atcoder; using lint = long long; using ulint = unsigned long long; #define endl '\n' int const INF = 1<<30; lint const INF64 = 1LL<<61; // lint const Mod = 1e9+7; long const mod = 998244353; lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}} lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}} lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;} lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);} lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;} lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;} lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;} double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));} string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;} string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;} vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}} lint Kai[20000001]; bool firstCallnCr = true; lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= mod;} firstCallnCr = false;} if(n<0)return 0; if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;} struct edge{ int to; }; using graph = vector<vector<edge>>; int main(){ lint n,m; cin >> n >> m; graph g(n); int u[m], v[m]; for(int i = 0; i < m; i++) { cin >> u[i] >> v[i]; u[i]--; v[i]--; } dsu d(n); vector<int>f(n); for(int i = m-1; i >=0;i--) { if(d.same(u[i], v[i])) { f[d.leader(u[i])] += 1; } else { int ul = d.leader(u[i]); int vl = d.leader(v[i]); d.merge(u[i], v[i]); f[d.leader(u[i])] = max(f[ul], f[vl]) + 1; } } cout << f[d.leader(0)] << endl; }