# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
460792 |
2021-08-09T09:48:59 Z |
idas |
Exam (eJOI20_exam) |
C++11 |
|
2 ms |
332 KB |
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i = (begin); i < (end); i++)
#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define SZ(x) ((int)((x).size()))
#define LE(vec) vec[vec.size()-1]
#define TSTS int t; cin >> t; while(t--)solve()
const int INF = 1e9;
const long long LINF = 1e18;
const long double PI = asin(1)*2;
const int MOD = 1e9+7;
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef map<int, int> mii;
typedef long long ll;
typedef long double ld;
void setIO()
{
FAST_IO;
}
void setIO (string s) {
setIO();
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
const int N=5e3+10;
int n, a[N], b[N], t[2*N];
void build()
{
for(int i=n-1; i>=0; i--) t[i]=max(t[i<<1], t[i<<1|1]);
}
int get(int l, int r)
{
int ret=0;
for(l+=n, r+=n; l<r; l>>=1, r>>=1){
if(l&1) ret=max(ret, t[l++]);
if(r&1) ret=max(ret, t[--r]);
}
return ret;
}
int main()
{
setIO();
cin >> n;
FOR(i, 0, n)
{
cin >> t[i+n];
}
build();
FOR(i, 0, n) cin >> b[i];
int x=b[0], in=0, ans=0;
FOR(i, 0, n)
{
int val=get(in, i+1);
if(val==x){
ans=max(ans, i-in+1);
}
else if(val>x){
in++;
}
}
while(in<n){
int val=get(in, n);
if(val==x){
ans=max(ans, n-in+1);
}
in++;
}
cout << ans;
}
Compilation message
exam.cpp: In function 'void setIO(std::string)':
exam.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
31 | freopen((s+".in").c_str(),"r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
exam.cpp:32:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
32 | freopen((s+".out").c_str(),"w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |