摘要：出错竟然是1LL写成了 1#include#include#include#includeusing namespace std;typedef long long LL;int n,k,m;LL L,R;vector a, s1;void sol(){ cin>>n>>k>>L>>R; for(i... 阅读全文

摘要：用Bitset好，输出搞反一次#include#include#include#include#includeusing namespace std;const int SZ=1024;int n,m,cnt;bitset bs[SZ];inline void ins(bitset x){ f... 阅读全文

摘要：只有0-1的高斯消元法，还是挺简单的#include#include#include#includeusing namespace std;typedef long long LL;int n,ans;pair a[1001];LL s[64];inline bool ins(LL x){ f... 阅读全文

摘要：话说最早听说的算法之一是高斯消元法，三十多年了。#include#include#includeusing namespace std;int n;double x[11][11],y[11][11];int main(){ int i,j,k; scanf("%d",&n); for(i=0;i0... 阅读全文

摘要：昨天做错了，没遇到环就开搜。今天改之。话说在洛谷上被1秒卡掉一个解，算了不改了。#include#include#includeusing namespace std;typedef long long LL;typedef struct{ int val,next,type; // type:0-... 阅读全文

摘要：被简单错误卡#include#include#includeusing namespace std;const int INF=999999999;int n, m, K, dp[102], disabled[102];vector > edge[22];int main() {int e; cin... 阅读全文

摘要：新年做一道1001#include #include #include #include using namespace std;const int INF=0x7fffffff;int n,m,n1,m2,z;vector > > edge;vector ans; // 到达时间multiset ... 阅读全文