oj.uz

Submission #886695

# Submission time Handle Problem Language Result Execution time Memory
886695 2023-12-12T16:46:35 Z vjudge1 Doktor (COCI17_doktor) C++17
40 / 100
 173 ms 94388 KB 
#include <bits/stdc++.h>
using namespace std;
#define sp << " " << 
#define int long long
#define vi vector<int>
#define F(xxx,yyy) for (int xxx=1;xxx<=yyy;xxx++)
#define pii pair<int,int>
#define pb push_back
const int N = 5e5+1;
const int inf = 1e9+1;


vi bit(N,0);
int n;
void add(int p,int v) {
  for (int i=p;i<=n;i+=i&-i) bit[i]+=v;
}
int get(int p) {
  int ans = 0;
  for (int i=p;i>0;i-=i&-i) ans+=bit[i];
  return ans;
}

void solve() {  
  cin >> n;
  vi a(n+1);
  F(i,n) cin >> a[i];
  vi v(n+1);
  F(i,n) v[i] = a[i]+i;
  pii anss;
  int best = 0;
  vi poss[2*n+1];
  F(i,n) poss[v[i]].push_back(i);
  for (int i=2;i<=n+(n-1);i++){
    for (auto it : poss[i]) add(it,1);
    if (get(i-1) > best) {
      best = get(i-1);
      anss = {1,i-1};
    }
    for (auto it : poss[i]) add(it,-1);
  }
  cout << a[anss.first] sp a[anss.second] << endl;
}
    
                  
                             
signed main() { 
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  #ifdef Local
  freopen("in","r",stdin);
  freopen("out","w",stdout); 
  #endif
  int t = 1;
  //cin >> t;
	F(i,t) solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4188 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4188 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4188 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4472 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4700 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Incorrect 1 ms 4272 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5212 KB Output is correct
2 Runtime error 61 ms 51644 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 12124 KB Output is correct
2 Correct 13 ms 11740 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 173 ms 94388 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 102 ms 58756 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -