# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
69223 | 2018-08-20T09:50:10 Z | FedericoS | Boat (APIO16_boat) | C++14 | 2000 ms | 360 KB |
#include <iostream> #include <vector> #include <algorithm> #include <iostream> using namespace std; typedef long long int ll; typedef pair<ll,ll> pll; ll M=1000000007; int N; ll X[505],Y[505]; vector<int> G; pll T[1005]; int main(){ cin>>N; for(int i=0;i<N;i++){ cin>>X[i]>>Y[i]; Y[i]++; G.push_back(X[i]); G.push_back(Y[i]); } sort(G.begin(),G.end()); for(int i=1;i<G.size();i++) if(G[i-1]!=G[i]) for(int i=0;i<1000;i++) for(int j=0;j<500;j++) for(int k=j;k<500;k++) N=(N+N)%M; cout<<0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2043 ms | 248 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2043 ms | 248 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2072 ms | 360 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2043 ms | 248 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |