oj.uz

Submission #377024

# Submission time Handle Problem Language Result Execution time Memory
377024 2021-03-12T18:32:09 Z SavicS Difference (POI11_roz) C++14
0 / 100
 70 ms 65540 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1000005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n;
string s;

vector<int> vec[maxn];

int pref[maxn][26];

int main()
{
   	ios::sync_with_stdio(false);
   	cout.tie(nullptr);
  	cin.tie(nullptr);
	cin >> n >> s;
	s = ' ' + s;
	ff(i,1,n){
		vec[s[i] - 'a'].pb(i);
		pref[i][s[i] - 'a'] += 1;
		ff(j,0,25)pref[i][j] += pref[i - 1][j];
	}
	// ne moze ovako treba ono koje se najvise i najmanje pojavljuje
	int rez = 0;
	ff(a,0,25){
		// za slovo a 
		if(vec[a].empty())continue;
		ff(b,0,25){
			if(vec[b].empty() || a == b)continue;
			int mn = 0;
			ff(i,0,sz(vec[a]) - 1){
				int id = vec[a][i];
				int kol = i + 1 - pref[id][b] - mn;
				rez = max(rez, kol);
				mn = min(mn, i + 1 - pref[id][b]);
			}			
		}
	}
	cout << rez << endl;
   	return 0;
}
/**



// probati bojenje sahovski ili slicno

**/

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23788 KB Output is correct
2 Correct 17 ms 23788 KB Output is correct
3 Incorrect 17 ms 23788 KB Output isn't correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 49 ms 34664 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 70 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 59 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 52 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 56 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -