#include <bits/stdc++.h> #include "message.h" #include "kanapka.h" using namespace std; typedef long long ll; ll oneNodeCount( ) { ll bestSum = 0; ll sumT = 0; int s = 0, e = 0; int bs = -1, be = -1; for ( int i=0; i<GetN( ); ++i ) { int val = -GetTaste( i ); if ( sumT + val < val ) { sumT = val; s = i; e = i; } else { sumT += val; e = i; } if ( sumT > bestSum ) { bestSum = sumT; bs = s; be = e; } } if ( sumT > bestSum ) { bestSum = sumT; bs = s, be = e; } ll res = 0; for ( int i=0; i<GetN( ); ++i ) { if ( i >= bs && i <= be ) continue; res += GetTaste( i ); } return res; } int main( ) { if ( GetN( ) < NumberOfNodes( ) ) { if ( MyNodeId( ) ) return 0; cout << oneNodeCount( ) << endl; return 0; } int start = MyNodeId( ) * ( GetN( ) / NumberOfNodes( ) ); int end = MyNodeId( ) == NumberOfNodes( )-1 ? GetN( ) : ( MyNodeId( )+1 ) * ( GetN( ) / NumberOfNodes( ) ); ll bestSum = 0; ll sumT = 0; int s = 0, e = 0; int bs = -1, be = -1; if ( MyNodeId( ) > 0 ) { Receive( MyNodeId( )-1 ); bestSum = GetLL( MyNodeId( )-1 ); sumT = GetLL( MyNodeId( )-1 ); s = GetInt( MyNodeId( )-1 ); e = GetInt( MyNodeId( )-1 ); bs = GetInt( MyNodeId( )-1 ); be = GetInt( MyNodeId( )-1 ); } for ( int i=start; i<end; ++i ) { int val = -GetTaste( i ); if ( sumT + val < val ) { sumT = val; s = i; e = i; } else { sumT += val; e = i; } if ( sumT > bestSum ) { bestSum = sumT; bs = s; be = e; } } if ( MyNodeId( ) != NumberOfNodes( )-1 ) { PutLL( MyNodeId( )+1, bestSum ); PutLL( MyNodeId( )+1, sumT ); PutInt( MyNodeId( )+1, s ); PutInt( MyNodeId( )+1, e ); PutInt( MyNodeId( )+1, bs ); PutInt( MyNodeId( )+1, be ); Send( MyNodeId( )+1 ); } if ( MyNodeId( ) == NumberOfNodes( )-1 ) { for ( int i=0; i<NumberOfNodes( )-1; ++i ) { PutInt( i, bs ); PutInt( i, be ); Send( i ); } } else { Receive( NumberOfNodes( )-1 ); bs = GetInt( NumberOfNodes( )-1 ); be = GetInt( NumberOfNodes( )-1 ); } ll sumAll = 0; for ( int i=start; i<end; ++i ) { if ( i >= bs && i <= be ) continue; sumAll += GetTaste( i ); } if ( MyNodeId( ) ) { PutLL( 0, sumAll ); Send( 0 ); } else { for ( int i=1; i<NumberOfNodes( ); ++i ) { Receive( i ); sumAll += GetLL( i ); } cout << sumAll << endl; } return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 | #include <bits/stdc++.h> #include "message.h" #include "kanapka.h" using namespace std; typedef long long ll; ll oneNodeCount( ) { ll bestSum = 0; ll sumT = 0; int s = 0, e = 0; int bs = -1, be = -1; for ( int i=0; i<GetN( ); ++i ) { int val = -GetTaste( i ); if ( sumT + val < val ) { sumT = val; s = i; e = i; } else { sumT += val; e = i; } if ( sumT > bestSum ) { bestSum = sumT; bs = s; be = e; } } if ( sumT > bestSum ) { bestSum = sumT; bs = s, be = e; } ll res = 0; for ( int i=0; i<GetN( ); ++i ) { if ( i >= bs && i <= be ) continue; res += GetTaste( i ); } return res; } int main( ) { if ( GetN( ) < NumberOfNodes( ) ) { if ( MyNodeId( ) ) return 0; cout << oneNodeCount( ) << endl; return 0; } int start = MyNodeId( ) * ( GetN( ) / NumberOfNodes( ) ); int end = MyNodeId( ) == NumberOfNodes( )-1 ? GetN( ) : ( MyNodeId( )+1 ) * ( GetN( ) / NumberOfNodes( ) ); ll bestSum = 0; ll sumT = 0; int s = 0, e = 0; int bs = -1, be = -1; if ( MyNodeId( ) > 0 ) { Receive( MyNodeId( )-1 ); bestSum = GetLL( MyNodeId( )-1 ); sumT = GetLL( MyNodeId( )-1 ); s = GetInt( MyNodeId( )-1 ); e = GetInt( MyNodeId( )-1 ); bs = GetInt( MyNodeId( )-1 ); be = GetInt( MyNodeId( )-1 ); } for ( int i=start; i<end; ++i ) { int val = -GetTaste( i ); if ( sumT + val < val ) { sumT = val; s = i; e = i; } else { sumT += val; e = i; } if ( sumT > bestSum ) { bestSum = sumT; bs = s; be = e; } } if ( MyNodeId( ) != NumberOfNodes( )-1 ) { PutLL( MyNodeId( )+1, bestSum ); PutLL( MyNodeId( )+1, sumT ); PutInt( MyNodeId( )+1, s ); PutInt( MyNodeId( )+1, e ); PutInt( MyNodeId( )+1, bs ); PutInt( MyNodeId( )+1, be ); Send( MyNodeId( )+1 ); } if ( MyNodeId( ) == NumberOfNodes( )-1 ) { for ( int i=0; i<NumberOfNodes( )-1; ++i ) { PutInt( i, bs ); PutInt( i, be ); Send( i ); } } else { Receive( NumberOfNodes( )-1 ); bs = GetInt( NumberOfNodes( )-1 ); be = GetInt( NumberOfNodes( )-1 ); } ll sumAll = 0; for ( int i=start; i<end; ++i ) { if ( i >= bs && i <= be ) continue; sumAll += GetTaste( i ); } if ( MyNodeId( ) ) { PutLL( 0, sumAll ); Send( 0 ); } else { for ( int i=1; i<NumberOfNodes( ); ++i ) { Receive( i ); sumAll += GetLL( i ); } cout << sumAll << endl; } return 0; } |