AC with 72 iterations of ternary search of line normal angle starting with [-π/2, π/2].

For some reason, [0,π] does not work.

Edited by author 26.02.2015 13:30

Can you guys provide me with a brief math proof that searched direction always contains at least one rectangles vertex (that is, no need to search for it between those rays made from vertexes coordinates)?
Thanks.

Do not fight with precision, use fractions in Python 3.

Hi!, i have gotten AC in this problem, but i have 0.093 secs, and im not well ranked on the best solutions table, i think the difficult part of this problem is to see which triangle have historical monuments inside, i did it with an O ( logM * M * N ) approach, do anybody have something better? i really would like to know how to get 0.015 secs or less. Thank you very much! Eric ( Cuac!++ ).

Try this test:
a

Your output should be:
aa

Good luck!

Can someone give 5^th test?
I got WA5;

String symbols = "`~!№*@#$%^&*()-_=+\\|[{]};:'\",<.>/?в„– \n\r\t";

;)

6 7
1 2 3
2 3 3
3 4 4
1 4 4
4 5 5
2 6 3
6 5 3

Hi All,

Just want to share my experience solving this problem. I did it like this let the i be the number of bricks available and j be the height of the last step.
S[i][j] = sum(S[i-j][:j]) + (1 if (i-j) < j else 0)

So basically all i am doing is the number of stairs with i bricks and height j is also the same number of stairs with i-j bricks and max height of j - 1(hence the array stops at index j) and one more if i - j bricks are less than height j.

There might be more slick solution avaiable, but this worked for me :)

Edited by author 21.04.2018 01:11

Can you give some tests? The stars coordinates aren't natural numbers?

To find the shortest path from point O to lines AB and CD (in that order) one needs to consider three possibilities, namely projection from O to CD (if it intersects AB); projection on CD of the reflection of O thru AB (if it intersects AB); intersection of AB and CD.

#include <bits/stdc++.h>
using namespace std;

int query(int l, int r, vector<int> bucket, vector<int> v) {
    int n = v.size();
    int bkt_sz = sqrt(n);
    int bkts = bucket.size();

    int lb = l/bkt_sz;
    int rb = r/bkt_sz;
    int lbp = l%bkt_sz;
    int rbp = r%bkt_sz;


    int retval = -1;

    if (lb == rb) {
        for (int i=lb*bkt_sz+lbp; i <= lb*bkt_sz+rbp; i++)
            retval = max(retval, v[i]);
        return retval;
    }

    for (int i=lb+1; i < rb; i++)
        retval = max(retval, bucket[i]);

    for (int i=lb*bkt_sz+lbp; i<n; i++) {
        if (i >= (lb+1)*bkt_sz) break;
        retval = max(retval, v[i]);
    }

    for (int i=rb*bkt_sz; i <= rb*bkt_sz+rbp; i++) {
        retval = max(retval, v[i]);
    }

    return retval;
}

int main() {

    int k;
    cin >> k;

    vector<int> v;

    while (true) {
        int a;
        cin >> a;
        if (a == -1) break;
        v.push_back(a);
    }

    int n = v.size();
    int bkt_sz = sqrt(n);

    vector<int> bucket;

    int count = bkt_sz;
    int max_value = -1;
    for (int i=0; i<n; i++) {
        if (count == 0) {
            count = bkt_sz;
            bucket.push_back(max_value);
            max_value = -1;
        }
        count -= 1;
        max_value = max(max_value, v[i]);
    }

    bucket.push_back(max_value);

    for (int i=0; i+k-1 < n; i++) {
        cout << query(i, i+k-1, bucket, v) << endl;
    }

}

Edited by author 19.04.2018 22:19

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApplication8
{
    class Program
    {
        static void Main(string[] args)
        {
            int x;
            x = Convert.ToInt32 (Console.ReadLine());
            if ((x > 1 & x <= 4)
            {
                Console.WriteLine("few");
            }
            if (x > 5 & x<= 9)
            {
                Console.WriteLine("several");
            }
            if (x > 10 & x <= 19)
            {
                Console.WriteLine("pack");
            }
            if (x > 20 & x <= 49)
            {
                Console.WriteLine("lots");
            }
            if (x > 50 & x <= 99)
            {
                Console.WriteLine("horde");
            }
            if (x > 100 & x <= 249)
            {
                Console.WriteLine("throng");
            }
            if (x > 250 & x <= 499)
            {
                Console.WriteLine("swarm");
            }
            if (x > 500 & x <= 499)
            {
                Console.WriteLine("zounds");
            }
            if (x > 1000)
            {
                Console.WriteLine("legion");
            }
        }
    }
}

Да что тут не так?

Edited by author 18.04.2018 23:36

Edited by author 18.04.2018 23:37

there is O(n*m) D&C algorithm...  similar with ural 1674 and ural 1596

it is just extend of fermat point, the angle is 2*pi/3 if it is fermat point in this problem

three angles are  acos((c1*c1-c2*c2-c3*c3)/(2*c2*c3)),acos((c2*c2-c1*c1-c3*c3)/(2*c1*c3) and

acos((c3*c3-c1*c1-c2*c2)/(2*c1*c2))

how to get it ,just let two partial derivative to be zero,and square and add two equtation we can get it ,it is easy

Edited by moderator 23.08.2020 01:12

there is a line which isn't token "end" and has no ':' character and there is only one nonempty token..
I use OLE test it must be wrong test...