oj.uz

Submission #305965

# Submission time Handle Problem Language Result Execution time Memory
305965 2020-09-24T07:47:44 Z cheetose Arranging Shoes (IOI19_shoes) C++17
45 / 100
 35 ms 3836 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 987654321987654321
#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<db> 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 ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

ll count_swaps(Vi a){
	int n=a.size()/2;
	bool ok=1;
	fup(i,0,2*n-1,1){
		if(abs(a[i])!=abs(a[0]))ok=0;
	}
	if(ok){
		Vi vv;
		ll res=0;
		fup(i,0,2*n-1,1)if(a[i]<0)vv.pb(i);
		fup(i,0,n-1,1)res+=abs(vv[i]-2*i);
		return res;
	}
	if(n==1){
		if(a[0]>0)return 1;
		return 0;
	}
	return 1LL*(n-1)*n/2;
}/*
int main() {
	printf("%lld\n",count_swaps({1,1,1,-1,-1,-1}));
}*/

Compilation message

shoes.cpp: In function 'll count_swaps(Vi)':
shoes.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
shoes.cpp:47:2: note: in expansion of macro 'fup'
   47 |  fup(i,0,2*n-1,1){
      |  ^~~
shoes.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
shoes.cpp:53:3: note: in expansion of macro 'fup'
   53 |   fup(i,0,2*n-1,1)if(a[i]<0)vv.pb(i);
      |   ^~~
shoes.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
shoes.cpp:54:3: note: in expansion of macro 'fup'
   54 |   fup(i,0,n-1,1)res+=abs(vv[i]-2*i);
      |   ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 1 ms 288 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 4 ms 512 KB Output is correct
22 Correct 31 ms 2548 KB Output is correct
23 Correct 32 ms 2548 KB Output is correct
24 Correct 31 ms 2556 KB Output is correct
25 Correct 25 ms 2676 KB Output is correct
26 Correct 32 ms 3828 KB Output is correct
27 Correct 29 ms 3580 KB Output is correct
28 Correct 29 ms 3732 KB Output is correct
29 Correct 28 ms 3828 KB Output is correct
30 Correct 31 ms 3824 KB Output is correct
31 Correct 35 ms 3832 KB Output is correct
32 Correct 30 ms 3836 KB Output is correct
33 Correct 26 ms 3572 KB Output is correct
34 Correct 30 ms 3828 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 1 ms 256 KB Output is correct
37 Correct 31 ms 3828 KB Output is correct
38 Correct 28 ms 3828 KB Output is correct
39 Correct 30 ms 3828 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 31 ms 1912 KB Output is correct
6 Correct 30 ms 1920 KB Output is correct
7 Correct 32 ms 1920 KB Output is correct
8 Correct 28 ms 2040 KB Output is correct
9 Correct 31 ms 1912 KB Output is correct
10 Correct 30 ms 1912 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 1 ms 288 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 1 ms 288 KB Output isn't correct
4 Halted 0 ms 0 KB -