oj.uz

Submission #114257

# Submission time Handle Problem Language Result Execution time Memory
114257 2019-05-31T15:27:34 Z rajarshi_basu Bubble Sort 2 (JOI18_bubblesort2) C++14
0 / 100
 9000 ms 1004 KB 
#include <iostream>
#include <vector>
#include <set>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <complex>
#include <stack>
#include <set>
#include "bubblesort2.h"
#include <fstream>

#define FOR(i,n) for(int i=0;i<n;i++)
#define FORE(i,a,b) for(int i=a;i<=b;i++)
#define ll long long int
#define vi vector<int>
#define v vector
#define ii pair<int,int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pll pair<ll,ll>
#define cd complex<double> 
#define iil pair<ii,ll>
#define v vector


const int MAXN = 5e5+10;
const int INF = 1e9+5;
using namespace std;
//int n,k;

int arr[MAXN];
int rgt[MAXN];

void calc(int n){
	FOR(i,n){
		rgt[i] = -1;
		FORE(j,i+1,n-1){
			if(arr[j] < arr[i]){
				rgt[i] = j;
			}
		}
	}
}



vi countScans(vi ar,vi xx,vi vals){
	int n = ar.size();
	FOR(i,n)arr[i] = ar[i];
	int q = vals.size();
	vi ans(q);
	FOR(i,q){
		arr[xx[i]] = vals[i];
		calc(n);
		int mx = 0;
		/*FOR(j,n){
			if(rgt[j] == -1)continue;
			int cnt = 1;
			FOR(l,rgt[j]){
				cnt += arr[l]>arr[j];
			}
			mx = max(mx,cnt);
		}*/
		FOR(i,n){
			int ctr = 0;
			FOR(j,i){
				if(arr[j] > arr[i])ctr++;
			}
			mx = max(mx, ctr);
		}

		ans[i] = mx;
	}
	return ans;
}
/*
int main(){
	int n,q;
	cin >> n >> q;
	v<int> ar(n);
	
	FOR(i,n){
		cin >> ar[i];
	}
	v<int> x(q),vals(q);
	x.reserve(q);
	vals.reserve(q);

	FOR(i,q){
		cin >> x[i] >> vals[i];
	}

	
	vi ret = countScans(ar,x,vals);
	FOR(i,q)cout << ret[i] << " ";cout << endl;
	return 0;
}
*/

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 424 KB Output is correct
2 Correct 963 ms 384 KB Output is correct
3 Execution timed out 9082 ms 384 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 424 KB Output is correct
2 Correct 963 ms 384 KB Output is correct
3 Execution timed out 9082 ms 384 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 9088 ms 1004 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 424 KB Output is correct
2 Correct 963 ms 384 KB Output is correct
3 Execution timed out 9082 ms 384 KB Time limit exceeded
4 Halted 0 ms 0 KB -