oj.uz

Submission #56472

# Submission time Handle Problem Language Result Execution time Memory
56472 2018-07-11T12:38:36 Z ramchandra Lollipop (POI11_liz) C++14
82 / 100
 2000 ms 59308 KB 
#include <bits/stdc++.h>
#define in(x) ll x;cin>>x;
#define al(x) x.begin(),x.end()
#define vc vector
#define fo(i,a,b) for(ll i=a;i<b;i++)
using namespace std;
using ll = long long; // mem
int main(){
	cin.sync_with_stdio(false);
	cout.sync_with_stdio(false);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	in(n);in(m);
	//vc<ll> ar(2*n+50,-1);
	//vc<ll> ps(2*n+50,-1);
	//vc<ll> is(2*n+50,-1);
	const ll BIG=2e6+50;
	#define DF(zz) ll zz[BIG];fill(zz,zz+BIG,-1);
	DF(ar);
	DF(ps);
	DF(is);
	ll cnt = 0;
	ll fst = -1;
	fo(i,0,n){
		char c;cin>>c;
		bool tp = (c=='T');
		if(fst==-1 && !tp){fst = cnt;}
		ar[cnt]=i;
		ps[i]=cnt;
		cnt++; cnt+=tp;
	}
	if(fst==-1){fst = cnt;}
	ar[cnt] = n;
	ps[n] = cnt;
	ll sz = ar[fst];
	ll c[2] = {2,1};
	fo(i,ar[fst]-1,n){
		ll v = ps[i+1]-fst;
		//cout<<v<<" "<<c[v%2]<<endl;
		for(ll j = max(v,c[v%2]); j <= min((ll)(2*n),v+2*sz); j+=2){
			//assert(is[j] == -1);
			is[j] = i;
			//cerr<<"oh "<<j<<" "<<i<<endl;
		}
		c[v%2] = v+2*sz+2;
	}
	/*fo(i,1,sz+1){
		is[2*i] = ar[fst]-1;
	}*/
	fo(z,0,m){
		in(k);
		ll l=-1,r=-1;
	    if(fst+k<=cnt){
			if(ar[fst+k]==-1){
				l = ar[fst]+1;
				r = ar[fst+k-1];
			}
			else{
				l = ar[fst];
				r = ar[fst+k]-1;
			}
		}
		else {
			if(is[k]!=-1){
				r = is[k];
				l = ar[ps[r+1]-k];
			}
		}
		if(l!=-1){
			cout<<l+1<<" "<<r+1<<endl;
		}
		else {
			cout<<"NIE"<<endl;
		}
	}
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 47352 KB Output is correct
2 Correct 45 ms 47352 KB Output is correct
3 Correct 42 ms 47376 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 47448 KB Output is correct
2 Correct 49 ms 47448 KB Output is correct
3 Correct 48 ms 47524 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 47524 KB Output is correct
2 Correct 42 ms 47556 KB Output is correct
3 Correct 80 ms 47724 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 47724 KB Output is correct
2 Correct 72 ms 47724 KB Output is correct
3 Correct 65 ms 47724 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 47788 KB Output is correct
2 Correct 86 ms 47788 KB Output is correct
3 Correct 262 ms 48732 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 236 ms 48732 KB Output is correct
2 Correct 904 ms 51492 KB Output is correct
3 Correct 497 ms 51492 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 51492 KB Output is correct
2 Correct 252 ms 51492 KB Output is correct
3 Correct 458 ms 51492 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 736 ms 51492 KB Output is correct
2 Correct 734 ms 51492 KB Output is correct
3 Correct 986 ms 52240 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1410 ms 54928 KB Output is correct
2 Correct 1395 ms 54928 KB Output is correct
3 Correct 1747 ms 56156 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1064 ms 56156 KB Output is correct
2 Correct 1608 ms 56156 KB Output is correct
3 Correct 1822 ms 56304 KB Output is correct

Subtask #11
0 / 9.0

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

Subtask #12
0 / 9.0

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