{"problem":{"name":"Tournament Result","description":{"content":"$N$ players played a round-robin tournament. You are given an $N$\\-by-$N$ table $A$ containing the results of the matches. Let $A_{i,j}$ denote the element at the $i$\\-th row and $j$\\-th column of $A$","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc261_b"},"statements":[{"statement_type":"Markdown","content":"$N$ players played a round-robin tournament.\nYou are given an $N$\\-by-$N$ table $A$ containing the results of the matches. Let $A_{i,j}$ denote the element at the $i$\\-th row and $j$\\-th column of $A$.  \n$A_{i,j}$ is `-` if $i=j$, and `W`, `L`, or `D` otherwise.  \n$A_{i,j}$ is `W` if Player $i$ beat Player $j$, `L` if Player $i$ lost to Player $j$, and `D` if Player $i$ drew with Player $j$.\nDetermine whether the given table is contradictory.\nThe table is said to be contradictory when some of the following holds:\n\n*   There is a pair $(i,j)$ such that Player $i$ beat Player $j$, but Player $j$ did not lose to Player $i$;\n*   There is a pair $(i,j)$ such that Player $i$ lost to Player $j$, but Player $j$ did not beat Player $i$;\n*   There is a pair $(i,j)$ such that Player $i$ drew with Player $j$, but Player $j$ did not draw with Player $i$.\n\n## Constraints\n\n*   $2 \\leq N \\leq 1000$\n*   $A_{i,i}$ is `-`.\n*   $A_{i,j}$ is `W`, `L`, or `D`, for $i\\neq j$.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_{1,1}A_{1,2}\\ldots A_{1,N}$\n$A_{2,1}A_{2,2}\\ldots A_{2,N}$\n$\\vdots$\n$A_{N,1}A_{N,2}\\ldots A_{N,N}$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc261_b","tags":[],"sample_group":[["4\n-WWW\nL-DD\nLD-W\nLDW-","incorrect\n\nPlayer $3$ beat Player $4$, while Player $4$ also beat Player $3$, which is contradictory."],["2\n-D\nD-","correct\n\nThere is no contradiction."]],"created_at":"2026-03-03 11:01:14"}}