Crossings

Time Limit: 20 Sec

Memory Limit: 256 MB

题目连接

http://codeforces.com/gym/100463

Description

Given a permutation P of {0, 1, ..., n − 1}, we define the crossing number of it as follows. Write the sequence 0, 1, 2, . . . , n − 1 from left to right above the sequence P(0), P(1), . . . , P(n − 1). Draw a straignt line from 0 in the top line to 0 in the bottom line, from 1 to 1, and so on. The crossing number of P is the number of pairs of lines that cross. For example, if n = 5 and P = [1, 3, 0, 2, 4], then the crossing number of P is 3, as shown in the figure below. !""""#""""

""""""""&" In this problem a permutation will be specified by a tuple (n, a, b), where n is a prime and a and b are integers (1 ≤ a ≤ n − 1 and 0 ≤ b ≤ n − 1). We call this permutation Perm(n, a, b), and the ith element of it is a ∗ i + b mod n (with i in the range [0, n − 1]). So the example above is specified by Perm(5, 2, 1).

Input

There are several test cases in the input file. Each test case is specified by three space-separated numbers n, a, and b on a line. The prime n will be at most 1,000,000. The input is terminated with a line containing three zeros.

Output

For each case in the input print out the case number followed by the crossing number of the permutation. Follow the format in the example output.

Sample Input

5 2 1

19 12 7

0 0 0

Sample Output

Case 1: 3

Case 2: 77

给你三个数n,a,b

满足第i个数等于(a*i+b)%n，然后问你逆序数是多少

这个n有1e6呢，所以树状数组和归并都能解决这个题吧

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+10;
int d[N];
ll n,a,b;
void update(int x,int y) {while(x<=n) {d[x]+=y;x+=x&-x;}
}
int sum(int x) {int s=0;while(x>0) {s+=d[x];x-=x&-x;}return s;
}
int main() {int k=1;while(~scanf("%lld%lld%lld",&n,&a,&b)) {if(!n&&!a&&!b)break;memset(d,0,sizeof(d));ll ans=0;for(int i=0; i<n; i++) {int x=(a*i+b)%n+1;ans+=sum(x-1);update(x,1);}printf("Case %d: %lld\n",k++,(n-1)*n/2-ans);}
}

转载于:https://www.cnblogs.com/BobHuang/p/7258369.html

2011 Michigan Invitational Programming Contest相关推荐

2011 Heilongjiang collegiate programming contest 【(7+1)/10】 [补完]
题目链接: [CDOJ] https://vjudge.net/contest/170394#overview [hrbust1395~1402(中文题面哦!) ] http://acm.hrbust ...
The North American Invitational Programming Contest 2016 - Tourists ( LCA )
题意给出一棵n个点,n-1条边的树.现在计算所有标号为x到y的距离之和(满足y>x且y是x的倍数) 思路关于树上任意两点距离之和,一开始想到树形dp,可树形dp,是对每条边,求所有可能的路径 ...
2015 HIAST Collegiate Programming Contest J
Polygons Intersection 题意:给2个凸多边形,求相交面积思路:不会,套板子就是了 AC代码: #include "iostream" #include &qu ...
(寒假开黑gym)2017-2018 ACM-ICPC German Collegiate Programming Contest (GCPC 2017)
layout: post title: (寒假开黑gym)2017-2018 ACM-ICPC German Collegiate Programming Contest (GCPC 2017) au ...
The 15th UESTC Programming Contest Preliminary C - C0ins cdoj1554
地址:http://acm.uestc.edu.cn/#/problem/show/1554 题目: C0ins Time Limit: 3000/1000MS (Java/Others) M ...
【AtCoder】diverta 2019 Programming Contest 2
diverta 2019 Programming Contest 2 A - Ball Distribution 特判一下一个人的,否则是\(N - (K - 1) - 1\) #include &l ...
2018 German Collegiate Programming Contest (GCPC 18)
2018 German Collegiate Programming Contest (GCPC 18) Attack on Alpha-Zet 建树,求lca 代码: #include <al ...
Atcoder Keyence Programming Contest 2020 D - Swap and Flip
Atcoder Keyence Programming Contest 2020 D - Swap and Flip 题目描述 Solution 写了一个简单的O(2nn(n+w))O(2^nn(n+ ...
2018-2019 ICPC Northwestern European Regional Programming Contest (NWERC 2018)
2018-2019 ICPC Northwestern European Regional Programming Contest (NWERC 2018) 题号题目知识点难度 A Access ...

2011 Michigan Invitational Programming Contest

Crossings

题目连接

Description

2011 Michigan Invitational Programming Contest相关推荐

最新文章

热门文章