How can i solve ioi 2013 practice task problems specially citizen task
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
How can i solve ioi 2013 practice task problems specially citizen task
Name |
---|
I have a solution to the citicen task, but unfortunately I can't proof it.
My Algorithm is: sort due to a special rule and than go threw the sorted array and take all elements, which are possible in attention to the previously taken ones. (i.e. Q < min(taken P))
To compare two countries on smaller, you use the following function.
P1 < Q2 && P2 > Q1 -> country 1 is not smaller
P2 < Q1 && P1 > Q2 -> country 1 is smaller
P1 > Q2 && P2 > Q1 -> country 1 is smaller if: Q1 > Q2
else country 1 is smaller if: P1 > P2
Can anyone proof this... (due to tests with more than 1 Million of test data i think it is correct)
can you publish your source code
Please proof or disproof it — I had this problem, when i had to explain my solution in the training programm for the IOI.
struct T {
};
int countries(int N, int *pP, int *pQ)
{
}