Codeforces Round #404 (Div. 2) ABC

A. Anton and Polyhedrons

Anton's favourite geometric figures are regular polyhedrons. Note that there are five kinds of regular polyhedrons:

• Tetrahedron. Tetrahedron has 4 triangular faces.
• Cube. Cube has 6 square faces.
• Octahedron. Octahedron has 8 triangular faces.
• Dodecahedron. Dodecahedron has 12 pentagonal faces.
• Icosahedron. Icosahedron has 20 triangular faces.

All five kinds of polyhedrons are shown on the picture below:

Anton has a collection of n polyhedrons. One day he decided to know, how many faces his polyhedrons have in total. Help Anton and find this number!

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of polyhedrons in Anton's collection.

Each of the following n lines of the input contains a string si — the name of the i-th polyhedron in Anton's collection. The string can look like this:

• "Tetrahedron" (without quotes), if the i-th polyhedron in Anton's collection is a tetrahedron.
• "Cube" (without quotes), if the i-th polyhedron in Anton's collection is a cube.
• "Octahedron" (without quotes), if the i-th polyhedron in Anton's collection is an octahedron.
• "Dodecahedron" (without quotes), if the i-th polyhedron in Anton's collection is a dodecahedron.
• "Icosahedron" (without quotes), if the i-th polyhedron in Anton's collection is an icosahedron.

Output

Output one number — the total number of faces in all the polyhedrons in Anton's collection.

 #include <bits/stdc++.h>

 using namespace std;

 string str[] = {"Tetrahedron","Cube","Octahedron","Dodecahedron","Icosahedron"};
 int num[] = {,,,,};
 int main()
 {

     int n;
     scanf("%d",&n);
     int ans = ;
     for(int i=;i<n;i++) {
         string s;
         cin>>s;
         int flag = -;

         for(int i=;i<;i++) {
             if(str[i]==s) {
                 flag = i;
                 break;
             }
         }
         if(flag!=-) {
             ans += num[flag];
         }
     }
     cout<<ans<<endl;
     return ;
 }

B. Anton and Classes

Anton likes to play chess. Also he likes to do programming. No wonder that he decided to attend chess classes and programming classes.

Anton has n variants when he will attend chess classes, i-th variant is given by a period of time (l1, i, r1, i). Also he has m variants when he will attend programming classes, i-th variant is given by a period of time (l2, i, r2, i).

Anton needs to choose exactly one of n possible periods of time when he will attend chess classes and exactly one of m possible periods of time when he will attend programming classes. He wants to have a rest between classes, so from all the possible pairs of the periods he wants to choose the one where the distance between the periods is maximal.

The distance between periods (l1, r1) and (l2, r2) is the minimal possible distance between a point in the first period and a point in the second period, that is the minimal possible |i - j|, where l1 ≤ i ≤ r1 and l2 ≤ j ≤ r2. In particular, when the periods intersect, the distance between them is 0.

Anton wants to know how much time his rest between the classes will last in the best case. Help Anton and find this number!

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of time periods when Anton can attend chess classes.

Each of the following n lines of the input contains two integers l1, i and r1, i (1 ≤ l1, i ≤ r1, i ≤ 109) — the i-th variant of a period of time when Anton can attend chess classes.

The following line of the input contains a single integer m (1 ≤ m ≤ 200 000) — the number of time periods when Anton can attend programming classes.

Each of the following m lines of the input contains two integers l2, i and r2, i (1 ≤ l2, i ≤ r2, i ≤ 109) — the i-th variant of a period of time when Anton can attend programming classes.

Output

Output one integer — the maximal possible distance between time periods.

分析： 按照左右端点排序，找相隔最远的区间。

 #include <bits/stdc++.h>

 using namespace std;

 struct Chess {
     int l,r;
 }chess[];

 bool cmp1(Chess a,Chess b) {
     return a.r < b.r;
 }

 bool cmp3(Chess a,Chess b) {
     return a.l < b.l;
 }

 struct Prog {
     int l,r;
 }progs[];

 bool cmp2(Prog a,Prog b) {
     return a.l < b.l;
 }

 bool cmp4(Prog a,Prog b) {
     return a.r < b.r;
 }

 int main()
 {
     int n,m;
     scanf("%d",&n);

     for(int i=;i<n;i++)
         scanf("%d%d",&chess[i].l,&chess[i].r);

     scanf("%d",&m);
     for(int i=;i<m;i++)
         scanf("%d%d",&progs[i].l,&progs[i].r);

     sort(chess,chess+n,cmp1);
     sort(progs,progs+m,cmp2);

     int ans = ;
     if(chess[].r<progs[m-].l)
         ans = progs[m-].l - chess[].r;

     if(progs[].r<chess[n-].l)
         ans = max(ans,chess[n-].l-progs[].r);

     sort(chess,chess+n,cmp3);
     sort(progs,progs+m,cmp4);

     if(chess[n-].l>progs[].r) {
         ans = max(ans,chess[n-].l - progs[].r);
     }

     if(progs[m-].l>chess[].r) {
         ans = max(ans,progs[m-].l - chess[].r);
     }

     cout<<ans<<endl;

     return ;
 }

C. Anton and Fairy Tale

Anton likes to listen to fairy tales, especially when Danik, Anton's best friend, tells them. Right now Danik tells Anton a fairy tale:

"Once upon a time, there lived an emperor. He was very rich and had much grain. One day he ordered to build a huge barn to put there all his grain. Best builders were building that barn for three days and three nights. But they overlooked and there remained a little hole in the barn, from which every day sparrows came through. Here flew a sparrow, took a grain and flew away..."

More formally, the following takes place in the fairy tale. At the beginning of the first day the barn with the capacity of n grains was full. Then, every day (starting with the first day) the following happens:

• m grains are brought to the barn. If m grains doesn't fit to the barn, the barn becomes full and the grains that doesn't fit are brought back (in this problem we can assume that the grains that doesn't fit to the barn are not taken into account).
• Sparrows come and eat grain. In the i-th day i sparrows come, that is on the first day one sparrow come, on the second day two sparrows come and so on. Every sparrow eats one grain. If the barn is empty, a sparrow eats nothing.

Anton is tired of listening how Danik describes every sparrow that eats grain from the barn. Anton doesn't know when the fairy tale ends, so he asked you to determine, by the end of which day the barn will become empty for the first time. Help Anton and write a program that will determine the number of that day!

Input

The only line of the input contains two integers n and m (1 ≤ n, m ≤ 1018) — the capacity of the barn and the number of grains that are brought every day.

Output

Output one integer — the number of the day when the barn will become empty for the first time. Days are numbered starting with one.

分析：

当每次供给很大的时候，第二天总能将它补满，那么只能是，一天之内就将食物全部吃完。也就是第 n 天。

否则的话：

前 m 天，每次吃走一些，又补满，这样持续 m 天，m 天后，粮食才开始减少，每天减少 1 ，2,3，

也就是：

m + (1+mid)*mid/2 >=n 的时候就吃完了，注意这个 mid 时间，是 m 天之后的，那个时候才开始减少。也就是说，结果是 mid + m。

注意，二分的时候， 右区间的范围很大。

 #include <bits/stdc++.h>

 using namespace std;

 int main()
 {
     long long n,m;
     cin>>n>>m;

     if(m>=n)
         cout<<n<<endl;
     else {
         long long l = ,r = ((long long)<<);

         while(l<r) {

             long long mid = l + (r - l)/;
             if(m + (mid+)*mid/ < n)
                 l = mid+ ;
             else r = mid;

         }
         cout<<m+l<<endl;
     }

     return ;
 }