Submission #557119

#TimeUsernameProblemLanguageResultExecution timeMemory
557119VivalavildaMountains (NOI20_mountains)C++14
2 / 100
1 ms212 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double db; typedef string str; #define mp make_pair #define f first #define s second typedef pair<int,int> pi; typedef vector<int> vi; typedef vector<long long> vll; typedef vector<bool> vb; typedef vector<pi> vpi; #define all(x) begin(x), end(x) #define sor(x) sort(all(x)) #define rsor(x) sort(x.rbegin(), x.rend()) #define pb push_back #define forn(i,a,b) for (int i = (a); i < (b); ++i) #define fors(i,a,b,s) for (int i = (a); i < (b); i+=s) #define rofn(i,a,b) for (int i = (b)-1; i >= (a); --i) #define rep(n) for (int _ = 0; _ < n; _++) #define each(x, a) for (auto& x: a) #define debug(x) cout << #x << " = " << x << "\n"; #define vdebug(a) cout << #a << " = "; for(auto x: a) cout << x << " "; cout << "\n"; const int mod = 1e9+7; const int INF = INT_MAX >> 1; int add(int a, int b) {return (1LL * a + b) % mod;} int mul(int a, int b) {return (1LL * a * b) % mod;} ll n,D, a[300005]; int main () { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout<<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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...