# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1106970 | vjudge1 | Flooding Wall (BOI24_wall) | C++17 | 5062 ms | 6788 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 fori(i,a,b) for(int i=a;i<=b;i++)
#define int long long
#define pb push_back
using namespace std;
typedef pair<int,int> ii;
typedef tuple<int,int,int> tp;
const int M=1e6+10;
const int N=1e3+10;
const int mod=1e9+7;
int n,a[M],b[M];
int x[M],sum[M],kq=0;
void ktra()
{
stack<int> sk;
fori(i,1,n) sum[i]=sum[i-1]+x[i];
// fori(i,1,n) cout << x[i] << " ";
// cout << endl;
fori(i,1,n) {
while(!sk.empty()&&x[i]>=x[sk.top()])
{
kq+=x[sk.top()]*(i-sk.top())-sum[i-1]+sum[sk.top()-1];
sk.pop();
}
sk.push(i);
}
}
void duyet(int i)
{
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |