# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
270476 | test2 | Boat (APIO16_boat) | C++14 | 2077 ms | 9344 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define I inline void
using ll = int ;
using ld = long double ;
using namespace std ;
const int N = 2000 + 7 , mod = 1e9 + 7 ;
// how interesting!
int n;
ll ans ;
map<int , int > used ;
set<pair<int , int> > st ;
ll sz[N] ;
vector<pair<int , int> > v ;
ll f[N] ;
I add(int u , int v){
if(u <=v){
used[u] = used[v] = 1;
st.insert({u , v}) ;
}
}
vector<int> onepiece[N ] ;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |