nike0good |Oier&ACMer | 熟能生巧

Meta Hacker Cup 2024 题解

给111个n≤1e5n\le 1e5n≤1e5个点的图，每个点有权值sis_isi​。若222个点sis_isi​不同，则连边，否则不连边。有k≤20k \le 20k≤20个特例：原来连边变成不连，或者不连变成连。求最大完全子图如果没有特例点，每个sis_isi​取一个点即可。考虑有特例的情况：两个点从连边变成不连：枚举哪个点不在子图中两个点从不连边变成连：枚举是否两个点都在子图中剩下贪心#include<bits/stdc++.h> using namespace std;

染色问题，每次沿边染max，注意最后如果颜色数超过k，则可以按(k+1)-k-…-1的简单路径#include<bits/stdc++.h> using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define ForkD(i,k,n) for(in

B. Fox And Two Dotstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel is playing a mobile puzzle gam

A. DZY Loves Physicstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDZY loves Physics, and he enjoys calcul

求割点入门题！……死调一下午+晚上才发现把‘node'打成’nodes'了……Program P1523;const maxedge=999000; maxn=10000;var edge,tail:array[1..maxedge] of longint; size:longint; head:array[1..maxn] of longint;

Bellman_fordProgram P1860;var n,m,i,j,s:longint; v:double; flag:boolean; d:array[1..100] of double; x,y:array[1..100] of longint; map:array[1..100,1..4] of double;procedure r

差分约束……Program P1716;var n,i,j,minq,maxq:longint; d:array[-1..10000] of longint; w:array[1..30000,1..2] of longint; flag:boolean;function min(a,b:longint):longint;begin if a<b t

拓排+各种判……Program P1094;type map3=record indegree:array['A'..'Z'] of longint; map:array['A'..'Z',1..26] of char; outdegree:array['A'..'Z'] of longint; end;var

给定一个有向图，问这是不是树？各种判……出现2条相同的边不是树，自己指向自己不是树，除根节点入度为0外其它点入度必须为1，森林，环都不是树……program P1308;const maxn=15;Var i,j:longint; b:array[1..maxn,1..maxn] of boolean; indegree:array[1..maxn]