Submission #3895806


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
using namespace std;

#ifdef LOCAL
	#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
	#define eprintf(...) 42
#endif

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef long double ld;
#define mp make_pair
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MOD = (int)1e9 + 7;
int add(int x, int y) {
	x += y;
	if (x >= MOD) return x - MOD;
	return x;
}
int sub(int x, int y) {
	x -= y;
	if (x < 0) return x + MOD;
	return x;
}
int mult(int x, int y) {
	return ((ll)x * y) % MOD;
}
int div2(int x) {
	if (x & 1) x += MOD;
	return x / 2;
}

const int N = 3030;
int a[N];
int xs[N];
int n, m, k;
int b[N][2];
int c[N], d[N];
int ans;

int main()
{
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);

	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; i++) {
		scanf("%d", &a[i]);
		xs[i] = a[i];
	}
	sort(xs, xs + n);
	k = unique(xs, xs + n) - xs;
	for (int i = 0; i < n; i++)
		a[i] = lower_bound(xs, xs + k, a[i]) - xs;
	for (int i = 0; i < m; i++)
		for (int j = 0; j < 2; j++) {
			scanf("%d", &b[i][j]);
			b[i][j]--;
		}
	for (int it = k - 1; it >= 0; it--) {
		for (int i = 0; i < n; i++)
			c[i] = (int)(a[i] == it);
		for (int i = 0; i < m; i++) {
			int x = div2(add(c[b[i][0]], c[b[i][1]]));
			c[b[i][0]] = c[b[i][1]] = x;
		}
		int sum = 0;
		for (int i = 0; i < n; i++) {
			ans = add(ans, mult(sum, c[i]));
			ans = add(ans, div2(mult(c[i], d[i])));
			sum = add(sum, d[i]);
			d[i] = add(d[i], c[i]);
		}
	}
	for (int i = 0; i < m; i++) {
		ans = add(ans, ans);
	}
	printf("%d\n", ans);

	return 0;
}

Submission Info

Submission Time
Task D - Inversion Sum
User Um_nik
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 2110 Byte
Status AC
Exec Time 123 ms
Memory 384 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:69:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
                       ^
./Main.cpp:71:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
                     ^
./Main.cpp:80:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &b[i][j]);
                         ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 3
AC × 39
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 96 ms 384 KiB
02.txt AC 96 ms 256 KiB
03.txt AC 117 ms 256 KiB
04.txt AC 105 ms 384 KiB
05.txt AC 96 ms 384 KiB
06.txt AC 123 ms 384 KiB
07.txt AC 96 ms 256 KiB
08.txt AC 96 ms 256 KiB
09.txt AC 86 ms 256 KiB
10.txt AC 82 ms 384 KiB
11.txt AC 106 ms 384 KiB
12.txt AC 86 ms 384 KiB
13.txt AC 83 ms 256 KiB
14.txt AC 82 ms 256 KiB
15.txt AC 5 ms 384 KiB
16.txt AC 5 ms 384 KiB
17.txt AC 5 ms 384 KiB
18.txt AC 5 ms 256 KiB
19.txt AC 5 ms 256 KiB
20.txt AC 5 ms 384 KiB
21.txt AC 2 ms 384 KiB
22.txt AC 2 ms 256 KiB
23.txt AC 2 ms 384 KiB
24.txt AC 2 ms 384 KiB
25.txt AC 2 ms 384 KiB
26.txt AC 2 ms 256 KiB
27.txt AC 2 ms 256 KiB
28.txt AC 2 ms 384 KiB
29.txt AC 2 ms 384 KiB
30.txt AC 2 ms 384 KiB
31.txt AC 2 ms 256 KiB
32.txt AC 2 ms 256 KiB
33.txt AC 2 ms 256 KiB
34.txt AC 2 ms 384 KiB
35.txt AC 1 ms 256 KiB
36.txt AC 1 ms 256 KiB
s1.txt AC 1 ms 256 KiB
s2.txt AC 1 ms 256 KiB
s3.txt AC 1 ms 256 KiB