oj.uz

Submission #48775

# Submission time Handle Problem Language Result Execution time Memory
48775 2018-05-18T17:31:57 Z Pajaraja Fortune Telling 2 (JOI14_fortune_telling2) C++17
35 / 100
 1375 ms 101280 KB 
#include <bits/stdc++.h>
using namespace std;
map<int,int> m;
vector<int> zh,aq[400014];
int a[2][200007],t[200007],seg[1600056],bit[400014],inv[400014],lf[200007];
void upd(int l,int r,int v,int val,int ind)
{
	if(l==r) {seg[ind]=val; return;}
	int s=(l+r)/2;
	if(s>=v) upd(l,s,v,val,2*ind);
	else upd(s+1,r,v,val,2*ind+1);
	seg[ind]=max(seg[2*ind],seg[2*ind+1]);
}
int nmax(int l,int r,int lt,int rt,int ind)
{
	if(l>r) return 0;
	if(l>=lt  && r<=rt) return seg[ind];
	if(r<lt || l>rt) return 0;
	int s=(l+r)/2;
	return max(nmax(l,s,lt,rt,2*ind),nmax(s+1,r,lt,rt,2*ind+1));
}
void updf(int ind) {for(int i=ind;i<=zh.size();i+=(i&-i)) bit[i]++;}
int fval(int ind) 
{
	int sol=0;
	for(int i=ind;i;i-=(i&-i)) sol+=bit[i];
	return sol;
}
int main()
{
	int n,k;
	long long sol=0;
	scanf("%d%d",&n,&k);
	for(int i=0;i<n;i++) {scanf("%d%d",&a[0][i],&a[1][i]); zh.push_back(a[0][i]); zh.push_back(a[1][i]);}
	for(int i=1;i<=k;i++) {scanf("%d",&t[i]); zh.push_back(t[i]);}
	sort(zh.begin(),zh.end());
	int sz=zh.size();
	for(int i=0;i<zh.size();i++) m[zh[i]]=i;
	for(int i=1;i<=k;i++) upd(1,sz,m[t[i]],i,1);
	for(int i=0;i<n;i++) lf[i]=nmax(1,sz,m[min(a[0][i],a[1][i])],m[max(a[0][i],a[1][i])]-1,1);
	for(int i=0;i<n;i++) aq[lf[i]].push_back(i);
	for(int i=k;i>=1;i--)
	{
		updf(m[t[i]]+1);
		for(int j=0;j<aq[i].size();j++)
		{
			int b=min(a[0][aq[i][j]],a[1][aq[i][j]]),c=max(a[0][aq[i][j]],a[1][aq[i][j]]);
			if((fval(sz)-fval(m[c]))%2==0) sol+=c;
			else sol+=b; 
		}
	}
	for(int j=0;j<aq[0].size();j++)
	{
		int b=a[0][aq[0][j]],c=a[1][aq[0][j]];
		if((fval(sz)-fval(m[c]))%2==0) sol+=b;
		else sol+=c;
	}
	printf("%lld",sol);
}

Compilation message

fortune_telling2.cpp: In function 'void updf(int)':
fortune_telling2.cpp:22:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 void updf(int ind) {for(int i=ind;i<=zh.size();i+=(i&-i)) bit[i]++;}
                                   ~^~~~~~~~~~~
fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:38:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<zh.size();i++) m[zh[i]]=i;
              ~^~~~~~~~~~
fortune_telling2.cpp:45:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0;j<aq[i].size();j++)
               ~^~~~~~~~~~~~~
fortune_telling2.cpp:52:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j=0;j<aq[0].size();j++)
              ~^~~~~~~~~~~~~
fortune_telling2.cpp:33:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&k);
  ~~~~~^~~~~~~~~~~~~~
fortune_telling2.cpp:34:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<n;i++) {scanf("%d%d",&a[0][i],&a[1][i]); zh.push_back(a[0][i]); zh.push_back(a[1][i]);}
                        ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:35:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=k;i++) {scanf("%d",&t[i]); zh.push_back(t[i]);}
                         ~~~~~^~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9848 KB Output is correct
2 Correct 29 ms 9960 KB Output is correct
3 Correct 14 ms 10036 KB Output is correct
4 Correct 14 ms 10164 KB Output is correct
5 Correct 13 ms 10164 KB Output is correct
6 Correct 15 ms 10164 KB Output is correct
7 Correct 16 ms 10268 KB Output is correct
8 Correct 11 ms 10268 KB Output is correct
9 Correct 12 ms 10268 KB Output is correct
10 Correct 12 ms 10268 KB Output is correct
11 Correct 12 ms 10268 KB Output is correct
12 Correct 14 ms 10268 KB Output is correct
13 Correct 13 ms 10268 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 12120 KB Output is correct
2 Correct 122 ms 14196 KB Output is correct
3 Correct 201 ms 16672 KB Output is correct
4 Correct 292 ms 18672 KB Output is correct
5 Correct 276 ms 18672 KB Output is correct
6 Correct 303 ms 18672 KB Output is correct
7 Correct 301 ms 18672 KB Output is correct
8 Correct 275 ms 18676 KB Output is correct
9 Correct 172 ms 18676 KB Output is correct
10 Correct 142 ms 18676 KB Output is correct
11 Correct 137 ms 18676 KB Output is correct
12 Correct 183 ms 18676 KB Output is correct
13 Correct 141 ms 18676 KB Output is correct
14 Correct 212 ms 18676 KB Output is correct
15 Correct 206 ms 18676 KB Output is correct
16 Correct 241 ms 18676 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 648 ms 25072 KB Output is correct
2 Correct 1035 ms 32488 KB Output is correct
3 Correct 1314 ms 38636 KB Output is correct
4 Runtime error 1375 ms 101280 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -