http://codeforces.com/contest/499
A
水
You have decided to watch the best moments of some movie. There are two buttons on your player:
- Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
- Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output a single number — the answer to the problem.
2 3 5 6 10 12
6
1 1 1 100000
100000
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie.
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <math.h>
#include <stdlib.h>
#include <vector>
#include <queue>
using namespace std;
struct
{
int s;
int e;
}p[55];
int n,x;
int main()
{
while (scanf("%d %d", &n,&x) != EOF)
{
for (int i = 1; i <= n; i++)
{
scanf("%d %d",&p[i].s,&p[i].e);
}
int pos = 1;
int ans = 0;
for (int i = 1; i <= n; i++)
{
ans += ( p[i].s - pos ) % x;
ans += p[i].e - p[i].s+1;
pos = p[i].e + 1;
}
printf("%d\n",ans);
}
return 0;
}
B
水
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <vector>
#include <queue>
#include <map>
using namespace std;
struct
{
char s[10000];
char e[10000];
}p[10000];
int main()
{
int n, m;
while (scanf("%d %d", &n, &m) != EOF)
{
for (int i = 1; i <= m; i++)
{
scanf("%s %s",p[i].s,p[i].e);
int l1 = strlen(p[i].s);
int l2 = strlen(p[i].e);
if (l1 > l2)
{
char c[10000];
strcpy(c,p[i].s);
strcpy(p[i].s, p[i].e);
strcpy(p[i].e, c);
}
}
for (int i = 1; i <= n; i++)
{
char c[10000];
scanf("%s",c);
for (int j = 1; j <= m; j++)
{
if ( !strcmp(p[j].e, c) || !strcmp(p[j].s, c))
{
if (i == n)
{
printf("%s\n", p[j].s);
}
else
{
printf("%s ",p[j].s);
}
break;
}
}
}
}
return 0;
}
C
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and biare not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. Let's call each such region a block. We define an intersection as the point where at least two different roads intersect.
Your home is located in one of the blocks. Today you need to get to the University, also located in some block. In one step you can move from one block to another, if the length of their common border is nonzero (in particular, this means that if the blocks are adjacent to one intersection, but have no shared nonzero boundary segment, then it are not allowed to move from one to another one in one step).
Determine what is the minimum number of steps you have to perform to get to the block containing the university. It is guaranteed that neither your home nor the university is located on the road.
The first line contains two space-separated integers x1, y1 ( - 106 ≤ x1, y1 ≤ 106) — the coordinates of your home.
The second line contains two integers separated by a space x2, y2 ( - 106 ≤ x2, y2 ≤ 106) — the coordinates of the university you are studying at.
The third line contains an integer n (1 ≤ n ≤ 300) — the number of roads in the city. The following n lines contain 3 space-separated integers ( - 106 ≤ ai, bi, ci ≤ 106; |ai| + |bi| > 0) — the coefficients of the line aix + biy + ci = 0, defining the i-th road. It is guaranteed that no two roads are the same. In addition, neither your home nor the university lie on the road (i.e. they do not belong to any one of the lines).
Output the answer to the problem.
1 1 -1 -1 2 0 1 0 1 0 0
2
1 1 -1 -1 3 1 0 0 0 1 0 1 1 -3
2
Pictures to the samples are presented below (A is the point representing the house; B is the point representing the university, different blocks are filled with different colors):
带入两点, 判断使两点值符号不同直线有多少个,
不要直接判断 ,long long 不够存
#include<stdio.h>
#include<iostream>
#include<math.h>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<sstream>
#include<time.h>
#include<utility>
#include<malloc.h>
using namespace std;
long long sx, sy, ex, ey;
int n;
int main()
{
cin >> sx >> sy;
cin >> ex >> ey;
cin >> n;
int ans = 0;
while (n--)
{
long long a, b, c;
cin >> a >> b >> c;
int f1 = (sx * a + sy * b + c) > 0 ? 1 : 0;
int f2 = (ex * a + ey * b + c) > 0 ? 1 : 0;
if (f1 != f2)
{
ans++;
}
}
cout << ans << endl;
return 0;
}