oj.uz

Submission #203825

# Submission time Handle Problem Language Result Execution time Memory
203825 2020-02-22T11:29:57 Z cheetose Coin Collecting (JOI19_ho_t4) C++11
0 / 100
 6 ms 376 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

int cnt[2][100002];
int solve(int l,int r)
{
	queue<int> q;
	int c0=0,c1=0,d0=0,d1=0;
	fup(i,l,r,1)
	{
		if(cnt[0][i]>1)
		{
			fup(T,2,cnt[0][i],1)q.push(i);
			c0+=cnt[0][i]-1;
		}
		if(cnt[1][i]>1)
		{
			fup(T,2,cnt[1][i],1)q.push(i);
			c1+=cnt[1][i]-1;
		}
	}
	int res=0;
	fup(i,l,r,1)
	{
		if(!cnt[0][i])
		{
			d0++;
			res+=abs(i-q.front());
			q.pop();
		}
		if(!cnt[1][i])
		{
			d1++;
			res+=abs(i-q.front());
			q.pop();
		}
	}
	res+=abs(d0-c0);
	return res;
}
int main() {
	int n;
	scanf("%d",&n);
	ll ans=0;
	fup(i,0,2*n-1,1)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		y--;
		if(x<=1)
		{
			ans+=1-x;
			if(y>0)
			{
				ans+=y-1;
				cnt[1][1]++;
			}
			else
			{
				ans-=y;
				cnt[0][1]++;
			}
		}
		else if(x<n)
		{
			if(y>0)
			{
				ans+=y-1;
				cnt[1][x]++;
			}
			else
			{
				ans-=y;
				cnt[0][x]++;
			}
		}
		else
		{
			ans+=x-n;
			if(y>0)
			{
				ans+=y-1;
				cnt[1][n]++;
			}
			else
			{
				ans-=y;
				cnt[0][n]++;
			}
		}
	}
	int c=0;
	for(int i=0,j=1;j<=n;j++)
	{
		c+=cnt[0][j]+cnt[1][j];
		if(c==2*(j-i))
		{
			ans+=solve(i+1,j);
			c=0;
			i=j;
		}
	}
	printf("%lld",ans);
}

Compilation message

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:82:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
joi2019_ho_t4.cpp:87:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&x,&y);
   ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Incorrect 5 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Incorrect 5 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Incorrect 5 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -