Submission #1303829

#TimeUsernameProblemLanguageResultExecution timeMemory
1303829ByeWorldVision Program (IOI19_vision)C++20
12 / 100
1 ms836 KiB
#include "vision.h" #include <bits/stdc++.h> #pragma GCC optimize("O3", "Ofast") #define ll long long #define se second #define fi first #define pb push_back #define lf (id<<1) #define rg ((id<<1)|1) #define md ((l+r)>>1) using namespace std; typedef pair<int,int> pii; typedef pair<pii,pii> ipii; const int MAXN = 5e5+100; const int MAXA = 2e5+10; const int SQRT = 450; const ll INF = 2e9; const int MOD = 998244353; const int LOG = 60; ll sum(auto a, auto b){ ll te = a+MOD+b; for(; te >= MOD; ) te -= MOD; return te; } void chsum(int &a, auto b){ a = sum(a,b); } ll mul(auto a, auto b){ return 1ll*a*b%MOD; } void chmul(auto &a, auto b){ a = mul(a,b); } void chmn(auto &a, auto b){ a = min(a, b); } void chmx(auto &a, auto b){ a = max(a, b); } int h, w, k; void construct_network(int H, int W, int K) { h = H; w = W; k = K; int tot = h*w-1; if(h==1){ for(int i=0; i+k<w; i++){ vector<int> vec = {i, i+k}; int a = add_and(vec); tot++; } } else { for(int i=0; i+k<h; i++){ vector<int> vec = {i, i+k}; int a = add_and(vec); tot++; } } vector<int> vec; for(int i=h*w; i<=tot; i++) vec.pb(i); int a = add_or(vec); // std::vector<int> Ns; // Ns = {0, 1}; // int a = add_and(Ns); // Ns = {0, a}; // int b = add_or(Ns); // Ns = {0, 1, b}; // int c = add_xor(Ns); // add_not(c); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...