# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61188 | dukati8 | Boat (APIO16_boat) | C++14 | 2063 ms | 525312 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>
using namespace std;
#define rep(i,a,b) for (int i=a; i<int(b); i++)
long long m=1e9+7;
int main() {
int n;
cin >> n;
vector<long long> a(n);
vector<long long> b(n);
rep(i,0,n) {
cin >> a[i] >> b[i];
}
unordered_map<long long, long long> x;
x[0]=1;
rep (i,0,n) {
long long lo,hi;
lo=a[i];
hi=b[i];
long long sum=0;
vector<pair<long long, long long>> save;
for (auto c:x) {
long long size=c.first;
long long num=c.second;
//cout << size << " " << num << endl;
if (size<lo) {sum+=num; sum%=m;}
else if (size<hi) save.push_back(c);
}
//cout << endl;
Compilation message (stderr)
# | 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... |