F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_13803343_4169.cpp:19:1: error: stray '\' in program
 /\n is the mark of the endpoint
 ^
0_0_13803343_4169.cpp:156:1: error: stray '\314' in program
 题目链接:http://poj.org/problem?id=3204Ikki's Story I - Road ReconstructionTime Limit: 2000MSMemory Limit: 131072KTotal Submissions: 4573Accepted: 1217DescriptionIkki is the king of a small country – Phoenix, Phoenix is so small that there is only one city that is responsible for the production of daily goods, and uses the road network to transport the goods to the capital. Ikki finds that the biggest problem in the country is that transportation speed is too slow.Since Ikki was an ACM/ICPC contestant before, he realized that this, indeed, is a maximum flow problem. He coded a maximum flow program and found the answer. Not satisfied with the current status of the transportation speed, he wants to increase the transportation ability of the nation. The method is relatively simple, Ikki will reconstruct some roads in this transportation network, to make those roads afford higher capacity in transportation. But unfortunately, the country of Phoenix is not so rich in GDP that there is only enough money to rebuild one road. Ikki wants to find such roads that if reconstructed, the total capacity of transportation will increase.He thought this problem for a loooong time but cannot get it. So he gave this problem to frkstyc, who put it in this POJ Monthly contest for you to solve. Can you solve it for Ikki?InputThe input contains exactly one test case.The first line of the test case contains two integers N, M (N ≤ 500, M ≤ 5,000) which represents the number of cities and roads in the country, Phoenix, respectively.M lines follow, each line contains three integers a, b, c, which means that there is a road from city a to city b with a transportation capacity of c (0 ≤ a, b < n, c ≤ 100). All the roads are directed.Cities are numbered from 0 to n − 1, the city which can product goods is numbered 0, and the capital is numbered n − 1.OutputYou should output one line consisting of only one integer K, denoting that there are K roads, reconstructing each of which will increase the network transportation capacity.Sample Input2 1 0 1 1Sample Output1SourcePOJ Monthly--2007.03.04, Ikki
 ^
0_0_13803343_4169.cpp:156:1: error: stray '\342' in program
0_0_13803343_4169.cpp:156:1: error: stray '\304' in program
0_0_13803343_4169.cpp:156:1: error: stray '\277' in program
0_0_13803343_4169.cpp:156:1: error: stray '\301' in program
0_0_13803343_4169.cpp:156:1: error: stray '\264' in program
0_0_13803343_4169.cpp:156:1: error: stray '\275' in program
0_0_13803343_4169.cpp:156:1: error: stray '\323' in program
0_0_13803343_4169.cpp:156:1: error: stray '\243' in program
0_0_13803343_4169.cpp:156:1: error: stray '\272' in program
0_0_13803343_4169.cpp:157:1: error: stray '\272' in program
 和浙大代码不同的是,不需要输入解的方案,只需要输出关键边的数量即可。。。
 ^
0_0_13803343_4169.cpp:157:1: error: stray '\315' in program
0_0_13803343_4169.cpp:157:1: error: stray '\325' in program
0_0_13803343_4169.cpp:157:1: error: stray '\343' in program
0_0_13803343_4169.cpp:157:1: error: stray '\264' in program
0_0_13803343_4169.cpp:157:1: error: stray '\363' in program
0_0_13803343_4169.cpp:157:1: error: stray '\264' in program
0_0_13803343_4169.cpp:157:1: error: stray '\372' in program
0_0_13803343_4169.cpp:157:1: error: stray '\302' in program
0_0_13803343_4169.cpp:157:1: error: stray '\353' in program
0_0_13803343_4169.cpp:157:1: error: stray '\262' in program
0_0_13803343_4169.cpp:157:1: error: stray '\273' in program
0_0_13803343_4169.cpp:157:1: error: stray '\315' in program
0_0_13803343_4169.cpp:157:1: error: stray '\254' in program
0_0_13803343_4169.cpp:157:1: error: stray '\265' in program
0_0_13803343_4169.cpp:157:1: error: stray '\304' in program
0_0_13803343_4169.cpp:157:1: error: stray '\312' in program
0_0_13803343_4169.cpp:157:1: error: stray '\307' in program
0_0_13803343_4169.cpp:157:1: error: stray '\243' in program
0_0_13803343_4169.cpp:157:1: error: stray '\254' in program
0_0_13803343_4169.cpp:157:1: error: stray '\262' in program
0_0_13803343_4169.cpp:157:1: error: stray '\273' in program
0_0_13803343_4169.cpp:157:1: error: stray '\320' in program
0_0_13803343_4169.cpp:157:1: error: stray '\350' in program
0_0_13803343_4169.cpp:157:1: error: stray '\322' in program
0_0_13803343_4169.cpp:157:1: error: stray '\252' in program
0_0_13803343_4169.cpp:157:1: error: stray '\312' in program
0_0_13803343_4169.cpp:157:1: error: stray '\344' in program
0_0_13803343_4169.cpp:157:1: error: stray '\310' in program
0_0_13803343_4169.cpp:157:1: error: stray '\353' in program
0_0_13803343_4169.cpp:157:1: error: stray '\275' in program
0_0_13803343_4169.cpp:157:1: error: stray '\342' in program
0_0_13803343_4169.cpp:157:1: error: stray '\265' in program
0_0_13803343_4169.cpp:157:1: error: stray '\304' in program
0_0_13803343_4169.cpp:157:1: error: stray '\267' in program
0_0_13803343_4169.cpp:157:1: error: stray '\275' in program
0_0_13803343_4169.cpp:157:1: error: stray '\260' in program
0_0_13803343_4169.cpp:157:1: error: stray '\270' in program
0_0_13803343_4169.cpp:157:1: error: stray '\243' in program
0_0_13803343_4169.cpp:157:1: error: stray '\254' in program
0_0_13803343_4169.cpp:157:1: error: stray '\326' in program
0_0_13803343_4169.cpp:157:1: error: stray '\273' in program
0_0_13803343_4169.cpp:157:1: error: stray '\320' in program
0_0_13803343_4169.cpp:157:1: error: stray '\350' in program
0_0_13803343_4169.cpp:157:1: error: stray '\322' in program
0_0_13803343_4169.cpp:157:1: error: stray '\252' in program
0_0_13803343_4169.cpp:157:1: error: stray '\312' in program
0_0_13803343_4169.cpp:157:1: error: stray '\344' in program
0_0_13803343_4169.cpp:157:1: error: stray '\263' in program
0_0_13803343_4169.cpp:157:1: error: stray '\366' in program
0_0_13803343_4169.cpp:157:1: error: stray '\271' in program
0_0_13803343_4169.cpp:157:1: error: stray '\330' in program
0_0_13803343_4169.cpp:157:1: error: stray '\274' in program
0_0_13803343_4169.cpp:157:1: error: stray '\374' in program
0_0_13803343_4169.cpp:157:1: error: stray '\261' in program
0_0_13803343_4169.cpp:157:1: error: stray '\337' in program
0_0_13803343_4169.cpp:157:1: error: stray '\265' in program
0_0_13803343_4169.cpp:157:1: error: stray '\304' in program
0_0_13803343_4169.cpp:157:1: error: stray '\312' in program
0_0_13803343_4169.cpp:157:1: error: stray '\375' in program
0_0_13803343_4169.cpp:157:1: error: stray '\301' in program
0_0_13803343_4169.cpp:157:1: error: stray '\277' in program
0_0_13803343_4169.cpp:157:1: error: stray '\274' in program
0_0_13803343_4169.cpp:157:1: error: stray '\264' in program
0_0_13803343_4169.cpp:157:1: error: stray '\277' in program
0_0_13803343_4169.cpp:157:1: error: stray '\311' in program
0_0_13803343_4169.cpp:157:1: error: stray '\241' in program
0_0_13803343_4169.cpp:157:1: error: stray '\243' in program
0_0_13803343_4169.cpp:157:1: error: stray '\241' in program
0_0_13803343_4169.cpp:157:1: error: stray '\243' in program
0_0_13803343_4169.cpp:157:1: error: stray '\241' in program
0_0_13803343_4169.cpp:157:1: error: stray '\243' in program
0_0_13803343_4169.cpp:159:1: error: stray '\327' in program
 注意:dfs不设置限制条件的话,这题竟然没有TLE,而是先RE(爆栈)了。。。。- -|已访问过的点一定要判定一下啊。。哪怕根据割的性质,一个点不会被两种颜色染色。
 ^
0_0_13803343_4169.cpp:159:1: error: stray '\242' in program
0_0_13803343_4169.cpp:159:1: error: stray '\322' in program
0_0_13803343_4169.cpp:159:1: error: stray '\342' in program
0_0_13803343_4169.cpp:159:1: error: stray '\243' in program
0_0_13803343_4169.cpp:159:1: error: stray '\272' in program
0_0_13803343_4169.cpp:159:1: error: stray '\262' in program
0_0_13803343_4169.cpp:159:1: error: stray '\273' in program
0_0_13803343_4169.cpp:159:1: error: stray '\311' in program
0_0_13803343_4169.cpp:159:1: error: stray '\350' in program
0_0_13803343_4169.cpp:159:1: error: stray '\326' in program
0_0_13803343_4169.cpp:159:1: error: stray '\303' in program
0_0_13803343_4169.cpp:159:1: error: stray '\317' in program
0_0_13803343_4169.cpp:159:1: error: stray '\336' in program
0_0_13803343_4169.cpp:159:1: error: stray '\326' in program
0_0_13803343_4169.cpp:159:1: error: stray '\306' in program
0_0_13803343_4169.cpp:159:1: error: stray '\314' in program
0_0_13803343_4169.cpp:159:1: error: stray '\365' in program
0_0_13803343_4169.cpp:159:1: error: stray '\274' in program
0_0_13803343_4169.cpp:159:1: error: stray '\376' in program
0_0_13803343_4169.cpp:159:1: error: stray '\265' in program
0_0_13803343_4169.cpp:159:1: error: stray '\304' in program
0_0_13803343_4169.cpp:159:1: error: stray '\273' in program
0_0_13803343_4169.cpp:159:1: error: stray '\260' in program
0_0_13803343_4169.cpp:159:1: error: stray '\243' in program
0_0_13803343_4169.cpp:159:1: error: stray '\254' in program
0_0_13803343_4169.cpp:159:1: error: stray '\325' in program
0_0_13803343_4169.cpp:159:1: error: stray '\342' in program
0_0_13803343_4169.cpp:159:1: error: stray '\314' in program
0_0_13803343_4169.cpp:159:1: error: stray '\342' in program
0_0_13803343


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2025 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.001000(s) query 1, Server time : 2025-02-17 08:38:30, Gzip enabled