Submission #109347

#TimeUsernameProblemLanguageResultExecution timeMemory
109347b2563125Boat (APIO16_boat)C++14
0 / 100
8 ms6272 KiB
#include<iostream> #include<algorithm> #include<vector> using namespace std; #define int long long #define vel vector<long long> #define V vector #define ll long long #define rep(i,n) for(int i=0;i<n;i++) int pr = 1000000007; int ref(int &a) { a = a % pr; a += pr; a = a % pr; return a; } void uni(vel &a) { vel ans(1, a[0]); int n = a.size(); rep(i,n - 1) { if (a[i + 1] != a[i]) { ans.push_back(a[i + 1]); } } a = ans; } int rui(int a, int n) { if (n == 0) { return 1; } int back = rui(a, n / 2); back *= back; ref(back); if (n % 2 == 0) { return back; } return (back*a) % pr; } int inv(int a) { return rui(a, pr - 2); } void pl(int &a, int b) { ref(b); a += b; ref(a); } signed main() { V<V<vel>> dp(2,V<vel>(500,vel(500))); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...