oj.uz

Submission #40039

# Submission time Handle Problem Language Result Execution time Memory
40039 2018-01-25T16:47:43 Z fest Fireworks (APIO16_fireworks) C++14
7 / 100
 0 ms 2996 KB 
// fest
#include <bits/stdc++.h>	

#define pb push_back
#define F first
#define S second
#define y1 dasdasfasfas
#define x1 wqdadfasfasfas
#define All(c) c.begin(), c.end()
#define SZ(A) (int((A).size()))
#define umap unordered_map
#define FILENAME ""
#define __ fflush(stdout)

typedef long long ll;
typedef long double ld;    

using namespace std;

void FREOPEN() {
	#ifdef COMP
		freopen(".in", "r", stdin);
		freopen("2.out", "w", stdout);
	#else
		freopen(FILENAME".in", "r", stdin);
		freopen(FILENAME".out", "w", stdout);
	#endif
}                           

inline double Time() {return (clock() * 1.0) / CLOCKS_PER_SEC; }             

const int N = 200500, inf = 1e9 * 2, MOD = (int)1e9 + 7;

char CH[N];

const ll INF = 1e18;

const int dx[] = {1, -1, 0, 0, -1, 1, -1, 1};
const int dy[] = {0, 0, 1, -1, -1, 1, 1, -1};

int p[N];

int main() {
  
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int x;
		cin >> x >> p[i];				
	}
	sort(p + 1, p + 1 + m);
	int mid = (m + 1) / 2;
	ll ans = 0;
	for (int i = 1; i <= m; i++) {
		ans += abs(p[i] - p[mid]);
	}
	cout << ans;
	return 0;	
}

Compilation message

fireworks.cpp: In function 'void FREOPEN()':
fireworks.cpp:25:37: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(FILENAME".in", "r", stdin);
                                     ^
fireworks.cpp:26:39: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(FILENAME".out", "w", stdout);
                                       ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2996 KB Output is correct
2 Correct 0 ms 2996 KB Output is correct
3 Correct 0 ms 2996 KB Output is correct
4 Correct 0 ms 2996 KB Output is correct
5 Correct 0 ms 2996 KB Output is correct
6 Correct 0 ms 2996 KB Output is correct
7 Correct 0 ms 2996 KB Output is correct
8 Correct 0 ms 2996 KB Output is correct
9 Correct 0 ms 2996 KB Output is correct
10 Correct 0 ms 2996 KB Output is correct

Subtask #2
0 / 19.0

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

Subtask #3
0 / 29.0

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

Subtask #4
0 / 45.0

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