usaco-4.1-fence6-passed

呵呵，这也能过？

/*
ID: qq104801
LANG: C++
TASK: fence6
*/

#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;

const int INF=1<<25;
const int nmax=200;
static int n,a[nmax][nmax],d[nmax][nmax];
static int len[nmax],le[nmax][nmax],rig[nmax][nmax];
static int s,ans;

void test()
{
    freopen("fence6.in","r",stdin);
    freopen("fence6.out","w",stdout);
    //init readin and change
    cin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)a[i][j]=INF;

    for(int i=1;i<=n;i++)
    {
        cin>>s;
        cin>>len[s]>>le[s][0]>>rig[s][0];
        for(int j=1;j<=le[s][0];j++)cin>>le[s][j];
        for(int j=1;j<=rig[s][0];j++)cin>>rig[s][j];
    }

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=le[i][0];j++)a[i][le[i][j]]=len[i]+len[le[i][j]];
        for(int j=1;j<=rig[i][0];j++)a[i][rig[i][j]]=len[i]+len[rig[i][j]];
    }

    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)d[i][j]=a[i][j];
    //work Floyd
    ans=1<<30;
    for(int k=1;k<=n;k++)
    {
        for(int i=1;i<=le[k][0];i++)
        {
            int ii=le[k][i];
            if(ii<k)
            {
                for(int j=1;j<=rig[k][0];j++)
                {
                    int jj=rig[k][j];
                    if(jj<k)
                        ans=min(ans,a[ii][jj]+d[k][ii]+d[k][jj]);
                }
            }
        }
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
    }
    cout<<ans/2<<endl;
}

int main ()
{
    test();
    return 0;
}

test data:

USACO Training
Grader Results
13 users online
BGD/1 CHN/4 USA/8

USER: cn tom [qq104801]
TASK: fence6
LANG: C++

Compiling...
Compile: OK

Executing...
   Test 1: TEST OK [0.008 secs, 4000 KB]
   Test 2: TEST OK [0.008 secs, 4000 KB]
   Test 3: TEST OK [0.005 secs, 4000 KB]
   Test 4: TEST OK [0.005 secs, 4000 KB]
   Test 5: TEST OK [0.005 secs, 4000 KB]
   Test 6: TEST OK [0.011 secs, 4000 KB]
   Test 7: TEST OK [0.005 secs, 4000 KB]
   Test 8: TEST OK [0.005 secs, 4000 KB]
   Test 9: TEST OK [0.022 secs, 4000 KB]

All tests OK.

YOUR PROGRAM (‘fence6‘) WORKED FIRST TIME! That‘s fantastic -- and a rare thing. Please accept these special automated congratulations.

Here are the test data inputs:

------- test 1 ----
10
1 16 2 2
2 7
10 6
2 3 2 2
1 7
8 3
3 3 2 1
8 2
4
4 8 1 3
3
9 10 5
5 8 3 1
9 10 4
6
6 6 1 2
5
1 10
7 5 2 2
1 2
8 9
8 4 2 2
2 3
7 9
9 5 2 3
7 8
4 5 10
10 10 2 3
1 6
4 9 5
------- test 2 ----
3
1 1 1 1
2
3
2 1 1 1
3
1
3 1 1 1
1
2
------- test 3 ----
6
1 3 2 2
2 3
6 5
3 3 2 2
1 2
4 5
5 5 2 2
3 4
6 1
2 3 2 2
6 4
1 3
4 5 2 2
3 5
2 6
6 5 2 2
1 5
4 2
------- test 4 ----
12
1 100 1 2
2
3 4
2 99 1 1
3
1
3 101 1 2
2
1 4
4 3 2 2
5 7
1 3
5 76 2 1
7 4
6
6 75 1 2
5
8 9
7 77 2 1
5 4
8
8 74 1 2
7
6 9
9 4 2 2
10 12
6 8
10 102 2 1
12 9
11
11 100 1 1
10
12
12 101 1 2
11
9 10
------- test 5 ----
12
1 24 1 7
2
10 9 12 3 4 6 7
2 37 1 1
1
3
3 214 1 7
2
1 10 9 12 4 6 7
4 83 1 7
5
1 10 9 3 12 6 7
5 247 1 1
4
6
6 10 1 7
5
1 10 3 12 4 7 9
7 15 1 7
8
1 10 3 12 4 6 9
8 73 1 1
7
9
9 135 1 7
8
1 10 3 12 4 6 7
10 42 1 7
11
1 3 12 4 6 7 9
11 191 1 1
10
12
12 85 1 7
11
10 1 3 4 6 7 9
------- test 6 ----
14
1 1 1 1
14
2
4 1 1 1
5
3
13 1 1 1
14
12
14 1 1 1
13
1
9 2 1 2
6
10 8
7 14 2 1
5 6
8
11 1 1 1
12
10
2 1 1 1
1
3
10 1 1 2
11
9 8
8 23 2 1
10 9
7
3 1 1 1
2
4
6 2 2 1
5 7
9
5 1 1 2
4
6 7
12 1 1 1
13
11
------- test 7 ----
31
16 10 2 2
2 15
17 18
1 80 1 1
2
3
2 80 1 2
1
15 16
4 80 2 2
3 5
8 9
5 200 2 1
3 4
7
21 80 1 2
18
20 22
22 80 2 2
20 21
23 27
6 160 2 2
9 10
7 14
7 80 1 2
5
6 14
8 10 2 1
4 9
15
17 10 2 1
16 18
19
9 10 2 2
4 8
6 10
10 10 2 1
9 6
11
11 10 1 2
10
29 12
14 80 2 1
6 7
13
15 10 2 1
2 16
8
18 80 2 1
16 17
21
30 10 2 2
19 20
24 23
19 10 1 2
17
20 30
20 80 2 2
19 30
21 22
23 80 2 2
22 27
30 24
12 80 2 2
11 29
13 26
13 80 1 2
14
12 26
24 10 2 1
23 30
31
25 80 2 2
27 28
31 29
26 80 2 1
12 13
28
27 80 2 2
22 23
25 28
28 80 2 1
27 25
26
3 80 1 2
1
4 5
29 10 2 2
11 12
31 25
31 10 1 2
24
29 25
------- test 8 ----
100
1 8 1 1
100
2
2 8 1 1
1
3
3 8 1 1
2
4
4 8 1 1
3
5
5 8 1 1
4
6
6 8 1 1
5
7
7 8 1 1
6
8
8 8 1 1
7
9
9 8 1 1
8
10
10 8 1 1
9
11
11 8 1 1
10
12
12 8 1 1
11
13
13 8 1 1
12
14
14 8 1 1
13
15
15 8 1 1
14
16
16 8 1 1
15
17
17 8 1 1
16
18
18 8 1 1
17
19
19 8 1 1
18
20
20 8 1 1
19
21
21 8 1 1
20
22
22 8 1 1
21
23
23 8 1 1
22
24
24 8 1 1
23
25
25 8 1 1
24
26
26 8 1 1
25
27
27 8 1 1
26
28
28 8 1 1
27
29
29 8 1 1
28
30
30 8 1 1
29
31
31 8 1 1
30
32
32 8 1 1
31
33
33 8 1 1
32
34
34 8 1 1
33
35
35 8 1 1
34
36
36 8 1 1
35
37
37 8 1 1
36
38
38 8 1 1
37
39
39 8 1 1
38
40
40 8 1 1
39
41
41 8 1 1
40
42
42 8 1 1
41
43
43 8 1 1
42
44
44 8 1 1
43
45
45 8 1 1
44
46
46 8 1 1
45
47
47 8 1 1
46
48
48 8 1 1
47
49
49 8 1 1
48
50
50 8 1 1
49
51
51 8 1 1
50
52
52 8 1 1
51
53
53 8 1 1
52
54
54 8 1 1
53
55
55 8 1 1
54
56
56 8 1 1
55
57
57 8 1 1
56
58
58 8 1 1
57
59
59 8 1 1
58
60
60 8 1 1
59
61
61 8 1 1
60
62
62 8 1 1
61
63
63 8 1 1
62
64
64 8 1 1
63
65
65 8 1 1
64
66
66 8 1 1
65
67
67 8 1 1
66
68
68 8 1 1
67
69
69 8 1 1
68
70
70 8 1 1
69
71
71 8 1 1
70
72
72 8 1 1
71
73
73 8 1 1
72
74
74 8 1 1
73
75
75 8 1 1
74
76
76 8 1 1
75
77
77 8 1 1
76
78
78 8 1 1
77
79
79 8 1 1
78
80
80 8 1 1
79
81
81 8 1 1
80
82
82 8 1 1
81
83
83 8 1 1
82
84
84 8 1 1
83
85
85 8 1 1
84
86
86 8 1 1
85
87
87 8 1 1
86
88
88 8 1 1
87
89
89 8 1 1
88
90
90 8 1 1
89
91
91 8 1 1
90
92
92 8 1 1
91
93
93 8 1 1
92
94
94 8 1 1
93
95
95 8 1 1
94
96
96 8 1 1
95
97
97 8 1 1
96
98
98 8 1 1
97
99
99 8 1 1
98
100
100 8 1 1
99
1
------- test 9 ----
93
1 25 2 1
90 93
2
2 25 1 1
1
3
3 25 1 1
2
4
4 25 1 1
3
5
5 25 1 1
4
6
6 25 1 1
5
7
7 25 1 1
6
8
8 25 1 1
7
9
9 25 1 1
8
10
10 25 1 1
9
11
11 25 1 1
10
12
12 25 1 1
11
13
13 25 1 1
12
14
14 25 1 1
13
15
15 25 1 1
14
16
16 25 1 1
15
17
17 25 1 1
16
18
18 25 1 1
17
19
19 25 1 1
18
20
20 25 1 1
19
21
21 25 1 1
20
22
22 25 1 1
21
23
23 25 1 1
22
24
24 25 1 1
23
25
25 25 1 1
24
26
26 25 1 1
25
27
27 25 1 1
26
28
28 25 1 1
27
29
29 25 1 1
28
30
30 25 1 2
29
31 91
31 25 2 1
30 91
32
32 25 1 1
31
33
33 25 1 1
32
34
34 25 1 1
33
35
35 25 1 1
34
36
36 25 1 1
35
37
37 25 1 1
36
38
38 25 1 1
37
39
39 25 1 1
38
40
40 25 1 1
39
41
41 25 1 1
40
42
42 25 1 1
41
43
43 25 1 1
42
44
44 25 1 1
43
45
45 25 1 1
44
46
46 25 1 1
45
47
47 25 1 1
46
48
48 25 1 1
47
49
49 25 1 1
48
50
50 25 1 1
49
51
51 25 1 1
50
52
52 25 1 1
51
53
53 25 1 1
52
54
54 25 1 1
53
55
55 25 1 1
54
56
56 25 1 1
55
57
57 25 1 1
56
58
58 25 1 1
57
59
59 25 1 1
58
60
60 25 1 2
59
61 92
61 25 2 1
60 92
62
62 25 1 1
61
63
63 25 1 1
62
64
64 25 1 1
63
65
65 25 1 1
64
66
66 25 1 1
65
67
67 25 1 1
66
68
68 25 1 1
67
69
69 25 1 1
68
70
70 25 1 1
69
71
71 25 1 1
70
72
72 25 1 1
71
73
73 25 1 1
72
74
74 25 1 1
73
75
75 25 1 1
74
76
76 25 1 1
75
77
77 25 1 1
76
78
78 25 1 1
77
79
79 25 1 1
78
80
80 25 1 1
79
81
81 25 1 1
80
82
82 25 1 1
81
83
83 25 1 1
82
84
84 25 1 1
83
85
85 25 1 1
84
86
86 25 1 1
85
87
87 25 1 1
86
88
88 25 1 1
87
89
89 25 1 1
88
90
90 25 1 2
89
1 93
93 250 2 2
1 90
92 91
91 250 2 2
92 93
30 31
92 250 2 2
91 93
61 60

Keep up the good work!
Thanks for your submission!

时间： 2024-10-10 18:04:50

usaco-4.1-fence6-passed的相关文章

USACO 4.1 Fence Loops

Fence Loops The fences that surround Farmer Brown's collection of pastures have gotten out of control. They are made up of straight segments from 1 through 200 feet long that join together only at their endpoints though sometimes more than two fences

COGS 696. [IOI1996][USACO 2.3] 最长前缀

★   输入文件:prefix.in   输出文件:prefix.out   简单对比时间限制:1 s   内存限制:128 MB 描述 USACO 2.3.1 IOI96 在生物学中,一些生物的结构是用包含其要素的大写字母序列来表示的.生物学家对于把长的序列分解成较短的序列(即元素)很感兴趣. 如果一个集合 P 中的元素可以通过串联(元素可以重复使用,相当于 Pascal 中的 “+” 运算符)组成一个序列 S ,那么我们认为序列 S 可以分解为 P 中的元素.元素不一定要全部出现(如下例中B

USACO prefix TrieTree + DP

/* ID:kevin_s1 PROG:prefix LANG:C++ */ #include <iostream> #include <cstdio> #include <string> #include <cstring> #include <vector> #include <map> #include <set> #include <algorithm> #include <cstdlib>

【USACO 1.3.4】牛式

[題目描述 ] 下面是一个乘法竖式,如果用我们给定的那n个数字来取代*,可以使式子成立的话,我们就叫这个式子牛式. * * * x * * ---------- * * * * * * ---------- * * * * 数字只能取代*,当然第一位不能为0,况且给定的数字里不包括0. 注意一下在美国的学校中教的"部分乘积",第一部分乘积是第二个数的个位和第一个数的积,第二部分乘积是第二个数的十位和第一个数的乘积. 写一个程序找出所有的牛式. [格式] INPUT FORMAT: (f

USACO Chapter 1 Section 1.1

USACO的题解和翻译已经很多了... 我只是把自己刷的代码保存一下. 1.PROB Your Ride Is Here 1 /* 2 ID:xiekeyi1 3 PROG:ride 4 LANG:C++ 5 */ 6 7 #include<bits/stdc++.h> 8 using namespace std ; 9 10 int main() 11 { 12 freopen("ride.in","r",stdin); 13 freopen(&quo

USACO Your Ride Is Here

[USACO]Your Ride Is Here It is a well-known fact that behind every good comet is a UFO. These UFOs often come to collect loyal supporters from here on Earth. Unfortunately, they only have room to pick up one group of followers on each trip. They do,

usaco月赛，2017.1总结

T1:跳舞的奶牛 大致题意:一个体积为k的舞台能够同时容纳k只奶牛一起跳舞,他们每头奶牛的跳舞时间不同,如果有一只奶牛跳完了第k+1头奶牛就会立刻上场跳舞,当所有奶牛跳完舞以后我们认为这次表演结束.现在给出奶牛个数,最多用时,每头奶牛的跳舞时间.求舞台最小为多大. 思路:本来写了个程序以为这道题很简单,刚开始排一下序然后就行了,结果交了以后发现只过了五组,然后才发现这道题不能改变顺序(所以说为什么我改变顺序了还是能过五组,usaco的数据也好水......),所以说我想到了堆,然后就用堆写了一下

USACO 4.1 Fence Loops（Floyd求最小环）

Fence Loops The fences that surround Farmer Brown's collection of pastures have gotten out of control. They are made up of straight segments from 1 through 200 feet long that join together only at their endpoints though sometimes more than two fences

插入排序的优化【不靠谱地讲可以优化到O(nlogn)】 USACO 丑数

首先我们先介绍一下普通的插排,就是我们现在一般写的那种,效率是O(n^2)的. 普通的插排基于的思想就是找位置,然后插入进去,其他在它后面的元素全部后移,下面是普通插排的代码: 1 #include<iostream> 2 #include<fstream> 3 #include<stdio.h> 4 using namespace std; 5 int a[200000]; 6 int p[200000]; 7 8 int main(){ 9 ios::sync_wi

JPA:detached entity passed to persist

Caused by: org.hibernate.PersistentObjectException: detached entity passed to persist: com.example.entity.UserInfo at org.hibernate.event.internal.DefaultPersistEventListener.onPersist(DefaultPersistEventListener.java:124) at org.hibernate.event.inte