제출 #1194592

#제출 시각아이디문제언어결과실행 시간메모리
1194592al95ireyizSeptember (APIO24_september)C++20
0 / 100
10 ms19192 KiB
//*** Bismillah ***// #pragma GCC optimize("O3") #pragma GCC optimize("fast-math") #pragma GCC optimize("unroll-loops") #pragma GCC optimize("no-stack-protector") #include <bits/stdc++.h> using namespace std; #if !defined(ONLINE_JUDGE) and !defined(EVAL) #include "template/debug.h" #else #define d(x...) #endif #define fr first #define sc second #define in insert #define ll long long #define pb push_back #define vll vector<ll> #define pll pair<ll,ll> #define vpll vector<pll> #define len(x)(ll)x.size() #define all(x)x.begin(),x.end() const ll INF = 1e9; const ll INFL = 1e18; const ll MOD = 1e9+7; // const ll MOD = 998244353; const ll maxn = 8e5+5; ll n,m,k=0; #include "september.h" vll g[maxn]; vll v; int solve(int N, int M, vector<int> F, vector<vector<int>> S){ n = N, m = M; v.clear(); for(ll i = 0; i <= n; i ++) g[i].clear(); return 1; } // void _(ll tt){ // } // signed main(){ // ll tm=clock(); // cin.tie(0)->sync_with_stdio(0); // ll t=1; // // cin>>t; // for(ll tt=1;tt<=t;tt++){ // _(tt); // } // cerr<<"\n\033[1;31mTime: \033[1;30m" \ // <<(double)(clock()-tm)/1000000<<"\033[1;32m seconds\n"; // }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...