Submission #518452

#TimeUsernameProblemLanguageResultExecution timeMemory
518452Yazan_AlattarGlobal Warming (CEOI18_glo)C++14
0 / 100
26 ms3648 KiB
#include <iostream> #include <fstream> #include <vector> #include <cstring> #include <algorithm> #include <set> #include <map> #include <queue> #include <list> #include <utility> #include <cmath> #include <numeric> #include <assert.h> using namespace std; typedef long long ll; #define F first #define S second #define pb push_back #define endl "\n" #define all(x) x.begin(), x.end() const int M = 300007; const ll inf = 1e18; const ll mod = 1e9 + 7; const double pi = acos(-1); const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}; ll n, x, a[M], segL[32 * M], segR[32 * M], ans; int main() { ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin >> n >> x; for(int i = 1; i <= n; ++i) cin >> a[i]; segL[32 * M - 1] = 1; segR[32 * M - 1] = 1; 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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...