OJ Board

First, see this code.
Very simple, there are 20000 threads, named thread1 ~ thread10000 and thread1-sleep ~ thread10000-sleep .
Every thread i -sleep sleeps for 1 second and thread i interrupts it:
public class InterruptTest {

public static void main(String[] args) throws Exception {
for (int i ...

, I forget to allocate memory for b.

This code: #include <iostream>
using namespace std;
int main() {
int a[2][3] = { {1, 2, 3}, {4, 5, 6} };
int *(*b)[3];
for (int i = 0; i < 2; i++)
for (int j = 0; j < 3; j++)
b[i][j] = &a[i][j];
for (int i = 0; i < 2; i++)
for (int j = 0; j < 3; j++)
cout << *b[i][j] << " ";
cout << endl ...

I've found where I was wrong and I get AC now. This input: The output should be: But my old program output:

I just wrote a brute force, enumerated every pair of vertices of the two polygons and find the LEFTMOST and RIGHTMOST line segment, comparing by CROSS PRODUCT. I got WA but not TLE. Could any body who has got AC check my output below?

Input: 3 3
3 2
5 3
5 1
1 2
2 3
2 1

4 3
3 4
4 5
4 1
3 2
2 3
1 2 ...

Jan wrote:But I still don't know whether the judge data is present or not (for this problem).

It seems like you said. I kept getting Runtime Error. But when I submitted a code with only an empty main function, it was Accepted. There is quite something wrong with the test data of this problem.

Jan wrote:You can apply dp. To be more specific you can use LCS (with minor changes).

You mean, for each given word, calculate its penalty with each word in the dictionary?

andmej wrote:what is LCS?

Longest Common Substring (or Subsequence).

Who can give some hints about the algorithm?

I find a good paper for this subject:

E. Ukkonen: On-line construction of suffix-trees. Algorithmica 14 (1995), 249-260.

from http://www.cs.helsinki.fi/u/ukkonen/.

In this code: Is there any way to initialize the array a in the constructor like the ":b(1)"? I tried "a({0})" and "a(0)" but failed.

I'm afraid ebookee.com accept only links but not files.

I want to say sorry to those to whom I send the book. I found the djvu file is not complete. It just has the first 6 chapters.
I have another pdf version of it, which is not complete either, but has the first 12 chapters. That's enough for the contents of suffix tree.
But the pdf file is 15 Mb. It's ...

I use the MPS algorithm introduced in the article The K shortest paths problem from this page. It's fast.

Yes, I also get it from emule. A 1.1M djvu file. If you want, I can email it to you.

But maybe I will not come to see this post again, so if you want me sent you the book, send me an email or private message.