problem_id stringlengths 6 6 | src_id stringlengths 10 10 | tgt_id stringlengths 10 10 | split stringclasses 1
value | language stringclasses 1
value | src_code stringlengths 60 490k | tgt_code stringlengths 54 149k | gem5_src_per_tc_ticks stringlengths 16 2.01k | gem5_tgt_per_tc_ticks stringlengths 16 1.97k | gem5_src_excluded stringclasses 324
values | gem5_tgt_excluded stringclasses 210
values | gem5_src_status stringclasses 2
values | gem5_tgt_status stringclasses 2
values | gem5_src_sum_ticks_all int64 193M 1,762B | gem5_tgt_sum_ticks_all int64 117M 1,354B | common_timed_case_ids stringclasses 437
values | correctness_kept_case_ids stringclasses 385
values | usable_case_ids stringclasses 718
values | n_common_timed int64 1 108 | n_kept int64 0 107 | n_usable int64 1 107 | n_cases_available int64 1 108 | src_n_fail int64 0 5 | tgt_n_fail int64 0 5 | pair_n_fail int64 0 5 | our_speedup_usable float64 0.31 70.3 | our_speedup_all float64 0.2 70.3 | ceiling_speedup float64 1 72.6 | flag_low_headroom bool 2
classes | flag_single_case bool 2
classes | flag_empty_kept bool 2
classes | pie_src_agg_runtime float64 0 1.45 | pie_tgt_agg_runtime float64 0 1.07 | pie_speedup float64 1.1 71.5 | pie_fastest_agg_runtime float64 0 0.36 | pie_src_verdict stringclasses 1
value | pie_tgt_verdict stringclasses 1
value | pie_fastest_agg_runtime_updated float64 0 0.36 | pie_src_reward_updated float64 0.1 1 | pie_target_reward_updated float64 0.02 1 | pie_src_reward_updated_pct_bin float64 1 10 | pie_target_reward_updated_pct_bin float64 1 10 | gem5_fastest_id stringlengths 10 10 | gem5_fastest_per_tc_ticks stringlengths 16 1.94k | gem5_fastest_usable_case_ids stringclasses 691
values | gem5_fastest_sum_ticks_usable int64 0 1,027B | our_fastest_speedup float64 0.99 73.4 ⌀ | pie_n_tests float64 | pie_test_agg_runtime float64 | pie_test_accuracy float64 | pie_test_compilation float64 | pie_src_code_accuracy float64 | pie_tgt_code_accuracy float64 | pie_src_code_compilation float64 | pie_tgt_code_compilation float64 | pie_src_code_runtime float64 | pie_tgt_code_runtime float64 | pie_fastest_code stringclasses 0
values | pie_fastest_code_len float64 | pie_fastest_code_runtime float64 | pie_fastest_code_accuracy float64 | pie_fastest_code_compilation float64 | pie_src_code_tc2time stringclasses 0
values | pie_tgt_code_tc2time stringclasses 0
values | pie_fastest_code_tc2time stringclasses 0
values | pie_tests_case_ids stringclasses 0
values |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p03352 | s743140059 | s147468699 | train | cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin>>n;
int count=0;
int k=sqrt(n);
int maxi=1;
for(int i=1; i<n; i++){
for(int j=2; j<n; j++){
if(pow(i,j)<=n){
count=pow(i,j);
maxi=max(count,maxi);
// cout<<i<<" "<<j<<" "<<maxi<<endl;
}
}}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int mx = 1;
for (int i = 2; i * i <= n; ++i) {
int s = i;
while (s * i <= n)
s *= i;
mx = max(s, mx);
}
cout << mx;
return 0;
} | {"0": 1036255220, "1": 13569613486, "2": 1071050552, "3": 1888739424, "4": 1406014896, "5": 1196234468, "6": 1648210850, "7": 2673446776, "8": 3401712600, "9": 1026183730, "10": 1019067478, "11": 1022712262, "12": 16977526852, "13": 19740439004, "14": 1113175492, "15": 1253405582, "16": 1023275968, "17": 1540628232, "1... | {"0": 1019893446, "1": 1020767176, "2": 1020434558, "3": 1020631898, "4": 1020434558, "5": 1020434558, "6": 1020530082, "7": 1020530082, "8": 1020631898, "9": 1019858268, "10": 1019843968, "11": 1019875428, "12": 1020767176, "13": 1020696820, "14": 1020434558, "15": 1020434558, "16": 1019848544, "17": 1020532942, "18":... | [23, 37, 39, 40, 41, 42, 43, 44, 102] | [] | ok | ok | 277,242,138,316 | 96,932,108,988 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 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, 9... | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 35, 36, 38, 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, 9... | 95 | 104 | 91 | 104 | 0 | 0 | 0 | 2.174407 | 2.860168 | 11.555162 | false | false | false | 0.088454 | 0.073844 | 1.197848 | 0.013899 | Accepted | Accepted | 0.013899 | 0.19596 | 0.188215 | 1 | 4 | s147468699 | {"0": 1019893446, "1": 1020767176, "2": 1020434558, "3": 1020631898, "4": 1020434558, "5": 1020434558, "6": 1020530082, "7": 1020530082, "8": 1020631898, "9": 1019858268, "10": 1019843968, "11": 1019875428, "12": 1020767176, "13": 1020696820, "14": 1020434558, "15": 1020434558, "16": 1019848544, "17": 1020532942, "18":... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 35, 36, 38, 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, 9... | 92,849,110,640 | 2.174407 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03352 | s383032031 | s798553866 | train | cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int main() {
int X;
cin >> X;
int ans=1;
for(int b=1;b<=1000;b++){
for(int p=2;p<=10;p++){
if((pow(b,p)<=X)&&(pow(b,p)>=ans)){
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <set>
#include <sstream>
#include <bitset>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
typedef long long ll;
using namespace std;
int main() {
int x;
ci... | {"0": 1339987506, "1": 1341386332, "2": 1339987506, "3": 1340900704, "4": 1340806038, "5": 1340806038, "6": 1341006524, "7": 1340898130, "8": 1341410642, "9": 1338981930, "10": 1338991940, "11": 1338993084, "12": 1339654602, "13": 1341856230, "14": 1340133080, "15": 1340806038, "16": 1338982502, "17": 1340806038, "18":... | {"0": 1042212028, "1": 1042023840, "2": 1042203162, "3": 1042237768, "4": 1042212886, "5": 1042195154, "6": 1042203734, "7": 1042141958, "8": 1042098486, "9": 1042238054, "10": 1042211742, "11": 1042153684, "12": 1041861392, "13": 1041852812, "14": 1042211170, "15": 1042212886, "16": 1042164552, "17": 1042237196, "18":... | [] | [] | ok | ok | 139,418,562,712 | 108,380,934,376 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.286375 | 1.286375 | 6.982099 | false | false | false | 0.097422 | 0.075733 | 1.286385 | 0.013899 | Accepted | Accepted | 0.013899 | 0.259674 | 0.183521 | 1 | 3 | s147468699 | {"0": 1019893446, "1": 1020767176, "2": 1020434558, "3": 1020631898, "4": 1020434558, "5": 1020434558, "6": 1020530082, "7": 1020530082, "8": 1020631898, "9": 1019858268, "10": 1019843968, "11": 1019875428, "12": 1020767176, "13": 1020696820, "14": 1020434558, "15": 1020434558, "16": 1019848544, "17": 1020532942, "18":... | [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, 8... | 106,118,865,424 | 1.313796 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03352 | s544288094 | s646099306 | train | cpp | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1e9+7;
const int INF=1001001... | {"0": 1047919158, "1": 17558295898, "2": 1088574058, "3": 2041889850, "4": 1473222322, "5": 1233484252, "6": 1751796618, "7": 3148244528, "8": 4137046056, "9": 1037464714, "10": 1029603432, "11": 1033308276, "12": 22046016564, "14": 1137850714, "15": 1299612600, "16": 1034508332, "17": 1627212730, "18": 1077233014, "19... | {"0": 1022152560, "1": 1022357622, "2": 1022152560, "3": 1022293558, "4": 1022294702, "5": 1022079058, "6": 1022293558, "7": 1022293558, "8": 1022293558, "9": 1021950358, "10": 1021950358, "11": 1021950358, "12": 1022357622, "13": 1022352760, "14": 1022152560, "15": 1022025576, "16": 1021950358, "17": 1022293558, "18":... | [13, 23, 33, 37, 39, 40, 41, 42, 43, 44, 102] | [] | ok | ok | 275,837,565,146 | 95,062,413,160 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 34, 35, 36, 38, 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, 9... | [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, 8... | [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 35, 36, 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, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, ... | 93 | 104 | 88 | 104 | 0 | 0 | 0 | 2.069805 | 2.901647 | 11.0192 | false | false | false | 0.091314 | 0.074113 | 1.232089 | 0.013899 | Accepted | Accepted | 0.013899 | 0.222189 | 0.187532 | 1 | 4 | s147468699 | {"0": 1019893446, "1": 1020767176, "2": 1020434558, "3": 1020631898, "4": 1020434558, "5": 1020434558, "6": 1020530082, "7": 1020530082, "8": 1020631898, "9": 1019858268, "10": 1019843968, "11": 1019875428, "12": 1020767176, "13": 1020696820, "14": 1020434558, "15": 1020434558, "16": 1019848544, "17": 1020532942, "18":... | [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 35, 36, 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, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, ... | 89,786,809,112 | 2.073583 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03352 | s824081779 | s759631282 | train | cpp | #include<bits/stdc++.h>
using namespace std ;
int main () {
int N ;
cin >> N ;
int ans = 0 ;
for(int i = 1 ; i <= 1+N ; i++ ){
for(int j = 2 ; j <= 2+N ; j++ ){
int pre = pow(i,j) ;
if( pre <= N ) ans = max(ans,pre) ;
}
}
cout << ans << endl ;
} | #include<bits/stdc++.h>
using namespace std ;
int main () {
int N ;
cin >> N ;
int ans = 0 ;
for(int i = 1 ; i <= 1+N ; i++ ){
for(int j = 2 ; j <= 2+N ; j++ ){
int pre = pow(i,j) ;
if( pre <= N ) ans = max(ans,pre) ;
else break ;
}
}
cout << ans << endl ;
}
| {"0": 1043096912, "1": 14156435150, "2": 1085243016, "3": 2036996676, "4": 1481087894, "5": 1236283048, "6": 1762946328, "7": 2906052578, "8": 3683449770, "9": 1030744572, "10": 1022950214, "11": 1026674792, "12": 17627889136, "13": 20436463476, "14": 1136441020, "15": 1302437994, "16": 1027596570, "17": 1638034684, "1... | {"0": 1025432980, "1": 1069661450, "2": 1028553812, "3": 1038834654, "4": 1034824362, "5": 1032263232, "6": 1037450986, "7": 1042615574, "8": 1046077890, "9": 1024585276, "10": 1022925046, "11": 1023645480, "12": 1075483552, "13": 1079073710, "14": 1030406234, "15": 1033172998, "16": 1023932624, "17": 1036744852, "18":... | [23, 37, 39, 40, 41, 42, 43, 44, 102] | [] | ok | ok | 289,554,485,506 | 98,433,688,496 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 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, 9... | [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, 8... | [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 35, 36, 38, 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 | 104 | 90 | 104 | 0 | 0 | 0 | 2.120665 | 2.94162 | 11.419836 | false | false | false | 0.091313 | 0.074753 | 1.221533 | 0.013899 | Accepted | Accepted | 0.013899 | 0.213917 | 0.185928 | 1 | 4 | s147468699 | {"0": 1019893446, "1": 1020767176, "2": 1020434558, "3": 1020631898, "4": 1020434558, "5": 1020434558, "6": 1020530082, "7": 1020530082, "8": 1020631898, "9": 1019858268, "10": 1019843968, "11": 1019875428, "12": 1020767176, "13": 1020696820, "14": 1020434558, "15": 1020434558, "16": 1019848544, "17": 1020532942, "18":... | [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 35, 36, 38, 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, ... | 91,828,343,464 | 2.148953 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03352 | s648785595 | s450771019 | train | cpp | /** author: __nishad__ **/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vll ;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define precision(k) cout<<setprecision(k)<<fixed;
#define loop(i,a) for(int i=0;... | /** author: __nishad__ **/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vll ;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define precision(k) cout<<setprecision(k)<<fixed;
#define loop(i,a) for(int i=0;... | {"0": 1084203120, "2": 1161192032, "3": 2813844462, "4": 1845203360, "5": 1419530112, "6": 2335244626, "7": 4372560478, "8": 5820319362, "9": 1060304388, "10": 1039750140, "11": 1051966058, "14": 1248249288, "15": 1535988740, "16": 1053585104, "17": 2118699440, "18": 1139270418, "19": 4939772266, "20": 1109184934, "21"... | {"0": 1065049986, "1": 14148743752, "2": 1107456350, "3": 2052386622, "4": 1498727230, "5": 1255189364, "6": 1780615980, "7": 2917199142, "8": 3696000594, "9": 1052674194, "10": 1039646608, "11": 1048708232, "12": 17612612732, "13": 20416163196, "14": 1156979538, "15": 1321415524, "16": 1049480718, "17": 1656471674, "1... | [1, 12, 13, 23, 33, 34, 37, 39, 40, 41, 42, 43, 44, 102] | [23, 37, 39, 40, 41, 42, 43, 44, 102] | ok | ok | 287,423,359,938 | 198,911,570,286 | [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 35, 36, 38, 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, ... | [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, 8... | [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 30, 31, 35, 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, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, ... | 90 | 104 | 85 | 104 | 0 | 0 | 0 | 1.313674 | 1.444981 | 11.679128 | false | false | false | 0.10573 | 0.092845 | 1.138788 | 0.013899 | Accepted | Accepted | 0.013899 | 0.140319 | 0.149697 | 1 | 1 | s147468699 | {"0": 1019893446, "1": 1020767176, "2": 1020434558, "3": 1020631898, "4": 1020434558, "5": 1020434558, "6": 1020530082, "7": 1020530082, "8": 1020631898, "9": 1019858268, "10": 1019843968, "11": 1019875428, "12": 1020767176, "13": 1020696820, "14": 1020434558, "15": 1020434558, "16": 1019848544, "17": 1020532942, "18":... | [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 30, 31, 35, 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, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, ... | 86,724,658,592 | 2.197799 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03352 | s954146983 | s080418400 | train | cpp | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int X;
cin >> X;
int maxValue = 1;
for (int i = 1; i <= X; i++) { // O(N^2) -> 1000 * 1000 = 10^6
f... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int X;
cin >> X;
int maxValue = 1;
vector<bool> expo(X + 1);
expo[1] = true;
for (int i = 2; i <=... | {"0": 1047205588, "1": 13606968518, "2": 1083054830, "3": 1906469708, "4": 1420426722, "5": 1209604110, "6": 1665095146, "7": 2695154748, "8": 3423495504, "9": 1037226762, "10": 1029425254, "11": 1033220760, "12": 17018552408, "13": 19784308830, "14": 1126098974, "15": 1266802966, "16": 1034376486, "17": 1556410570, "1... | {"0": 1031727554, "1": 1033161558, "2": 1031727554, "3": 1032350748, "4": 1032222620, "5": 1031737564, "6": 1032251220, "7": 1032381064, "8": 1032577260, "9": 1031752722, "10": 1031727268, "11": 1031753294, "12": 1033341452, "13": 1033376630, "14": 1031744428, "15": 1031744714, "16": 1031742998, "17": 1032248074, "18":... | [23, 37, 39, 40, 41, 42, 43, 44, 102] | [] | ok | ok | 278,851,726,582 | 98,051,125,172 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 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, 9... | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 35, 36, 38, 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, 9... | 95 | 104 | 91 | 104 | 0 | 0 | 0 | 2.165 | 2.843942 | 11.637573 | false | false | false | 0.088699 | 0.074655 | 1.188123 | 0.013899 | Accepted | Accepted | 0.013899 | 0.187756 | 0.186171 | 1 | 4 | s147468699 | {"0": 1019893446, "1": 1020767176, "2": 1020434558, "3": 1020631898, "4": 1020434558, "5": 1020434558, "6": 1020530082, "7": 1020530082, "8": 1020631898, "9": 1019858268, "10": 1019843968, "11": 1019875428, "12": 1020767176, "13": 1020696820, "14": 1020434558, "15": 1020434558, "16": 1019848544, "17": 1020532942, "18":... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 35, 36, 38, 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, 9... | 92,849,110,640 | 2.189915 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03352 | s523411834 | s048804173 | train | cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int X;
cin >> X;
double ans=1;
for(int i=X;i>0;--i){
for(int j=1;j<=sqrt(X);++j){
for(int k=2;k<=10;++k){
if(pow(j,k)<=X) ans=max(ans,pow(j,k));
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(v) v.begin(), v.end()
#define revall(v) v.rbegin(), v.rend... | {"0": 1070413344, "1": 6886422114, "2": 1132343498, "3": 1827608354, "4": 1482630864, "5": 1282507226, "6": 1665162928, "7": 2283663096, "8": 2756039858, "9": 1050218884, "10": 1035143538, "11": 1041160120, "12": 8159118110, "13": 9097893662, "14": 1187196868, "15": 1353617408, "16": 1042928458, "17": 1597865698, "18":... | {"0": 1037469004, "1": 1037469004, "2": 1037469004, "3": 1037473866, "4": 1037469004, "5": 1037469004, "6": 1037469004, "7": 1037474152, "8": 1037385492, "9": 1036812062, "10": 1036812062, "11": 1036684506, "12": 1037387208, "13": 1037469004, "14": 1037469004, "15": 1037474152, "16": 1036750286, "17": 1037476154, "18":... | [44] | [] | ok | ok | 315,124,393,870 | 106,845,255,088 | [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, 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, 8... | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 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, 8... | 103 | 104 | 100 | 104 | 0 | 0 | 0 | 2.51372 | 2.949353 | 13.58101 | false | false | false | 0.09126 | 0.075663 | 1.206138 | 0.013899 | Accepted | Accepted | 0.013899 | 0.201612 | 0.18369 | 1 | 3 | s147468699 | {"0": 1019893446, "1": 1020767176, "2": 1020434558, "3": 1020631898, "4": 1020434558, "5": 1020434558, "6": 1020530082, "7": 1020530082, "8": 1020631898, "9": 1019858268, "10": 1019843968, "11": 1019875428, "12": 1020767176, "13": 1020696820, "14": 1020434558, "15": 1020434558, "16": 1019848544, "17": 1020532942, "18":... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 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, 8... | 102,035,796,720 | 2.555528 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03352 | s936464260 | s334519600 | train | cpp | #include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cmath>
#define REP(n) for(int i = 0;i < n;i++)
#define LLREP(n) for(long long int i = 0;i < n;i++)
typedef long long int ll;
using namespace std;
#define MAX_A 100005
int main(){
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 1;
for (int i = 2; i <= n; i++) {
int num = i;
if (i*i > n)
{
break;
}
while (num * i <= n) {
num *= i;
}
ans = max(ans, num);
}
... | {"0": 1047205588, "1": 13606968518, "2": 1083054830, "3": 1906469708, "4": 1420426722, "5": 1209604110, "6": 1665095146, "7": 2695154748, "8": 3423495504, "9": 1037226762, "10": 1029425254, "11": 1033220760, "12": 17018552408, "13": 19784308830, "14": 1126098974, "15": 1266802966, "16": 1034376486, "17": 1556410570, "1... | {"0": 1022152560, "1": 1022357622, "2": 1022021286, "3": 1022352760, "4": 1022293558, "5": 1022152560, "6": 1022293558, "7": 1022293558, "8": 1022297848, "9": 1021950358, "10": 1021950358, "11": 1021950358, "12": 1022357622, "13": 1022357622, "14": 1022152560, "15": 1022152560, "16": 1021894588, "17": 1022293558, "18":... | [23, 37, 39, 40, 41, 42, 43, 44, 102] | [] | ok | ok | 278,851,726,582 | 97,107,046,322 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 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, 9... | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 35, 36, 38, 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, 9... | 95 | 104 | 91 | 104 | 0 | 0 | 0 | 2.185947 | 2.871591 | 11.637573 | false | false | false | 0.088699 | 0.074109 | 1.196875 | 0.013899 | Accepted | Accepted | 0.013899 | 0.195054 | 0.187542 | 1 | 4 | s147468699 | {"0": 1019893446, "1": 1020767176, "2": 1020434558, "3": 1020631898, "4": 1020434558, "5": 1020434558, "6": 1020530082, "7": 1020530082, "8": 1020631898, "9": 1019858268, "10": 1019843968, "11": 1019875428, "12": 1020767176, "13": 1020696820, "14": 1020434558, "15": 1020434558, "16": 1019848544, "17": 1020532942, "18":... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 35, 36, 38, 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, 9... | 92,849,110,640 | 2.189915 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03352 | s086696291 | s794890605 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int mypow(int n, int p) {
if (p == 0) return 1;
else if (p & 1) {
return n * mypow(n, p - 1);
} else {
int half = mypow(n, p >> 1);
return half * half;
}
}
int m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int mypow(int n, int p) {
if (p == 0) return 1;
else if (p & 1) {
return n * mypow(n, p - 1);
} else {
int half = mypow(n, p >> 1);
return half * half;
}
}
int m... | {"0": 1045405504, "2": 1076357568, "3": 2159257672, "4": 1433244098, "5": 1191882978, "6": 1798192110, "7": 3383467516, "8": 4807718058, "9": 1037206742, "10": 1034969078, "11": 1035943766, "14": 1112528560, "15": 1253146466, "16": 1036569820, "17": 1610530636, "18": 1067842204, "19": 3907238478, "20": 1055619994, "21"... | {"0": 1036332440, "1": 1036337588, "2": 1036340162, "3": 1036405942, "4": 1036399936, "5": 1036341592, "6": 1036333298, "7": 1036337016, "8": 1036388496, "9": 1035122660, "10": 1035098636, "11": 1035066318, "12": 1036399078, "13": 1036329294, "14": 1036337874, "15": 1036388496, "16": 1034981948, "17": 1036350744, "18":... | [1, 12, 13, 23, 33, 34, 37, 39, 40, 41, 42, 43, 44, 76, 102] | [] | ok | ok | 237,989,312,132 | 92,212,965,702 | [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 35, 36, 38, 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, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, ... | [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, 8... | [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 30, 31, 35, 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, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, ... | 89 | 104 | 85 | 104 | 0 | 0 | 0 | 1.874069 | 2.580866 | 10.113027 | false | false | false | 0.090852 | 0.075221 | 1.20781 | 0.013899 | Accepted | Accepted | 0.013899 | 0.20313 | 0.184771 | 1 | 4 | s147468699 | {"0": 1019893446, "1": 1020767176, "2": 1020434558, "3": 1020631898, "4": 1020434558, "5": 1020434558, "6": 1020530082, "7": 1020530082, "8": 1020631898, "9": 1019858268, "10": 1019843968, "11": 1019875428, "12": 1020767176, "13": 1020696820, "14": 1020434558, "15": 1020434558, "16": 1019848544, "17": 1020532942, "18":... | [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 30, 31, 35, 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, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, ... | 86,724,658,592 | 1.903087 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03352 | s367597367 | s401673396 | train | cpp | #include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
bool isPrime(int n)
{
if (n < 2)return false;
for (int i = 2; i < n; i++)
{
if (n % i == 0)return false;
}
}
int gcd(int a, int b)
{
for (int i = min(a, b); i >= 2; i--)
{
if (a % i == 0 && b % i == 0) return i;
... | #include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
bool isPrime(int n)
{
if (n < 2)return false;
for (int i = 2; i < n; i++)
{
if (n % i == 0)return false;
}
}
int gcd(int a, int b)
{
for (int i = min(a, b); i >= 2; i--)
{
if (a % i == 0 && b % i == 0) return i;
... | {"0": 1039259078, "1": 13979304482, "2": 1079078858, "3": 2010680958, "4": 1464966074, "5": 1222964314, "6": 1740224486, "7": 2866226792, "8": 3631954326, "9": 1028959074, "10": 1021504484, "11": 1025213332, "12": 17411339946, "13": 20190256658, "14": 1127502376, "15": 1288354782, "16": 1025418108, "17": 1617837078, "1... | {"0": 1024927332, "1": 1054439958, "2": 1026701962, "3": 1036099064, "4": 1033218472, "5": 1030133676, "6": 1034798622, "7": 1038301550, "8": 1040423098, "9": 1023807070, "10": 1021504484, "11": 1023275110, "12": 1058151380, "13": 1061276216, "14": 1028553812, "15": 1030949062, "16": 1023275110, "17": 1034504900, "18":... | [23, 37, 39, 40, 41, 42, 43, 44, 102] | [] | ok | ok | 286,332,719,530 | 98,102,504,214 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 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, 9... | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 35, 36, 38, 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, 9... | 95 | 104 | 91 | 104 | 0 | 0 | 0 | 2.228914 | 2.91871 | 11.974226 | false | false | false | 0.090661 | 0.0747 | 1.213676 | 0.013899 | Accepted | Accepted | 0.013899 | 0.207934 | 0.186059 | 1 | 4 | s147468699 | {"0": 1019893446, "1": 1020767176, "2": 1020434558, "3": 1020631898, "4": 1020434558, "5": 1020434558, "6": 1020530082, "7": 1020530082, "8": 1020631898, "9": 1019858268, "10": 1019843968, "11": 1019875428, "12": 1020767176, "13": 1020696820, "14": 1020434558, "15": 1020434558, "16": 1019848544, "17": 1020532942, "18":... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 35, 36, 38, 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, 9... | 92,849,110,640 | 2.253265 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03891 | s934094873 | s908179494 | train | cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int a[3][3],x,i;
cin>>a[0][0]>>a[0][1]>>a[1][1];
x=a[1][1]*3;
a[0][2]=x-a[0][0]-a[0][1];
a[2][1]=x-a[0][1]-a[1][1];
a[2][2]=x-a[0][0]-a[1][1];
a[2][0]=x-a[1][1]-a[0][2];
a[1][0]=x-a[0][0]-a[2][0];
a[1][2]=x-a[0][2]-a[2][2];
for(i=0;i<3;i++){... | #include<stdio.h>
int a,b,c;
int main()
{
scanf("%d%d%d",&a,&b,&c);
printf("%d %d %d\n",a,b,3*c-a-b);
printf("%d %d %d\n",(c<<2)-(a<<1)-b,c,(a<<1)+b-(c<<1));
printf("%d %d %d\n",a+b-c,(c<<1)-b,(c<<1)-a);
return 0 ;
} | {"0": 1023879428, "1": 1023705254, "2": 1024557820, "3": 1023951214, "4": 1024621884, "5": 1024621884, "6": 1024718552, "7": 1023951214, "8": 1023708686, "9": 1024621884, "10": 1024718552, "11": 1024718552, "12": 1023959794, "13": 1024556104, "14": 1023864842, "15": 1024557820, "16": 1024727132, "17": 1024635898, "18":... | {"0": 196367600, "1": 196304108, "2": 196679054, "3": 196953328, "4": 196803750, "5": 196803750, "6": 196865526, "7": 197032836, "8": 196572376, "9": 196803750, "10": 196865526, "11": 196865526, "12": 197027402, "13": 196803750, "14": 196367600, "15": 196679054, "16": 196886690, "17": 196865526, "18": 196888978, "19": ... | [] | [] | ok | ok | 105,492,105,290 | 20,254,309,218 | [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, 8... | [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, 8... | [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, 8... | 103 | 103 | 103 | 103 | 0 | 0 | 0 | 5.208378 | 5.208378 | 5.33435 | false | false | false | 0.025472 | 0.004792 | 5.31541 | 0.004792 | Accepted | Accepted | 0.004792 | 1 | 1 | 10 | 10 | s908179494 | {"0": 196367600, "1": 196304108, "2": 196679054, "3": 196953328, "4": 196803750, "5": 196803750, "6": 196865526, "7": 197032836, "8": 196572376, "9": 196803750, "10": 196865526, "11": 196865526, "12": 197027402, "13": 196803750, "14": 196367600, "15": 196679054, "16": 196886690, "17": 196865526, "18": 196888978, "19": ... | [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, 8... | 20,254,309,218 | 5.208378 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03891 | s218972214 | s908179494 | train | cpp | #include<iostream>
using namespace std;
int main()
{
int A,B,C;
cin>>A>>B>>C;
cout<<A<<' '<<B<<' '<<C*3-A-B<<endl<<4*C-2*A-B<<' '<<C<<' '<<2*A+B-2*C<<endl<<A+B-C<<' '<<C*2-B<<' '<<C*2-A;
}
| #include<stdio.h>
int a,b,c;
int main()
{
scanf("%d%d%d",&a,&b,&c);
printf("%d %d %d\n",a,b,3*c-a-b);
printf("%d %d %d\n",(c<<2)-(a<<1)-b,c,(a<<1)+b-(c<<1));
printf("%d %d %d\n",a+b-c,(c<<1)-b,(c<<1)-a);
return 0 ;
} | {"0": 1025028290, "1": 1025028290, "2": 1025502764, "3": 1025125244, "4": 1025502764, "5": 1025502764, "6": 1025502764, "7": 1025206182, "8": 1024398518, "9": 1025502764, "10": 1025502764, "11": 1025502764, "12": 1025206182, "13": 1025502764, "14": 1025032866, "15": 1025502764, "16": 1025560250, "17": 1025503050, "18":... | {"0": 196367600, "1": 196304108, "2": 196679054, "3": 196953328, "4": 196803750, "5": 196803750, "6": 196865526, "7": 197032836, "8": 196572376, "9": 196803750, "10": 196865526, "11": 196865526, "12": 197027402, "13": 196803750, "14": 196367600, "15": 196679054, "16": 196886690, "17": 196865526, "18": 196888978, "19": ... | [] | [] | ok | ok | 105,575,422,524 | 20,254,309,218 | [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, 8... | [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, 8... | [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, 8... | 103 | 103 | 103 | 103 | 0 | 0 | 0 | 5.212492 | 5.212492 | 5.338563 | false | false | false | 0.025424 | 0.004792 | 5.305361 | 0.004792 | Accepted | Accepted | 0.004792 | 1 | 1 | 10 | 10 | s908179494 | {"0": 196367600, "1": 196304108, "2": 196679054, "3": 196953328, "4": 196803750, "5": 196803750, "6": 196865526, "7": 197032836, "8": 196572376, "9": 196803750, "10": 196865526, "11": 196865526, "12": 197027402, "13": 196803750, "14": 196367600, "15": 196679054, "16": 196886690, "17": 196865526, "18": 196888978, "19": ... | [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, 8... | 20,254,309,218 | 5.212492 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03891 | s879637459 | s999078666 | train | cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,e,f,g,h,i;
cin>>a>>b>>e;
for(int s=-(1e6);s<=(1e6);s++){
h=s-(b+e);
c=s-(a+b);
i=s-(a+e);
f=s-(c+i);
d=s-(e+f);
g=s-(c+e);
if(a+b+c==s&&d+e+f==s&&g+h+i==s&&a+d+g==s&&b+e+h==s&&c+f... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,e,f,g,h,i;
cin>>a>>b>>e;
for(int s=-300;s<=300;s++){
h=s-(b+e);
c=s-(a+b);
i=s-(a+e);
f=s-(c+i);
d=s-(e+f);
g=s-(c+e);
if(a+b+c==s&&d+e+f==s&&g+h+i==s&&a+d+g==s&&b+e+h==s&&c+f+i==... | {"0": 3313410386, "1": 3313341746, "2": 3313509342, "3": 3313411530, "4": 3313486176, "5": 3313512774, "6": 3313731278, "7": 3313471876, "8": 3312733424, "9": 3313512774, "10": 3313626602, "11": 3313626602, "12": 3313471876, "13": 3313507626, "14": 3313470732, "15": 3313509342, "16": 3313710686, "17": 3313603722, "18":... | {"0": 1025550240, "1": 1025497044, "2": 1026509484, "3": 1025569116, "4": 1026532936, "5": 1026514918, "6": 1026659634, "7": 1025678940, "8": 1025210472, "9": 1026514918, "10": 1026625314, "11": 1026625314, "12": 1025608298, "13": 1026424256, "14": 1025573978, "15": 1026509484, "16": 1026715690, "17": 1026572976, "18":... | [] | [] | ok | ok | 341,264,859,936 | 105,670,677,112 | [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, 8... | [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, 8... | [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, 8... | 103 | 103 | 103 | 103 | 0 | 0 | 0 | 3.229513 | 3.229513 | 17.256516 | false | false | false | 0.082649 | 0.025472 | 3.244736 | 0.004792 | Accepted | Accepted | 0.004792 | 0.73439 | 0.188135 | 4 | 4 | s908179494 | {"0": 196367600, "1": 196304108, "2": 196679054, "3": 196953328, "4": 196803750, "5": 196803750, "6": 196865526, "7": 197032836, "8": 196572376, "9": 196803750, "10": 196865526, "11": 196865526, "12": 197027402, "13": 196803750, "14": 196367600, "15": 196679054, "16": 196886690, "17": 196865526, "18": 196888978, "19": ... | [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, 8... | 20,254,309,218 | 16.849 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p00232 | s133996477 | s200731165 | train | cpp | #include <cstdio>
#include <cstring>
#define MIN(A,B) ((A)<=(B)?(A):(B))
#define MAX(A,B) ((A)>=(B)?(A):(B))
int X,Y,Z,V[4],E[51],A[51];
double dp[51][5001];
int main() {
while(scanf("%d %d %d",&X,&Y,&Z),X) {
for(int i=0;i<X;i++) {
scanf("%d",&V[i]);
}
memset(E,0,sizeof(E));
memset(A,0,sizeof(A)... | #include <cstdio>
#include <cstring>
#define MIN(A,B) ((A)<=(B)?(A):(B))
#define MAX(A,B) ((A)>=(B)?(A):(B))
int X,Y,Z,V[4],E[51],A[51];
double dp[51][5001];
int main() {
while(scanf("%d %d %d",&X,&Y,&Z),X) {
for(int i=0;i<X;i++) {
scanf("%d",&V[i]);
}
memset(E,0,sizeof(E));
memset(A,0,sizeof(A)... | {"0": 5555643522, "1": 5555004026, "2": 5558034768, "3": 5552697150, "4": 5547003748, "5": 5544929962, "6": 5550395136, "7": 5547615788, "8": 5562573016, "9": 5560633364, "10": 5567364946, "11": 5576269270, "12": 5552328210, "13": 5569951816, "14": 5558818408, "15": 5554424304, "16": 5559579168, "17": 5557560008, "18":... | {"0": 5048092478, "1": 5048092478, "2": 5048090762, "3": 5048071886, "4": 5048086758, "5": 5048071886, "6": 5048086758, "7": 5047988374, "8": 5049997524, "9": 5047964922, "10": 5050003244, "11": 5049685212, "12": 5048290676, "13": 5049782166, "14": 5047863964, "15": 5048092478, "16": 5048092478, "17": 5047960918, "18":... | [] | [] | ok | ok | 568,216,274,054 | 515,054,996,742 | [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, 8... | [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, 8... | [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, 8... | 102 | 102 | 102 | 102 | 0 | 0 | 0 | 1.103215 | 1.103215 | 29.014311 | false | false | false | 0.562508 | 0.509848 | 1.103285 | 0.025842 | Accepted | Accepted | 0.025842 | 0.098124 | 0.050685 | 1 | 1 | s629291450 | {"0": 306676370, "1": 306676370, "2": 306598578, "3": 306675512, "4": 306676370, "5": 306593716, "6": 306848828, "7": 306043166, "8": 306676370, "9": 305969092, "10": 306957222, "11": 307045596, "12": 307043308, "13": 306536230, "14": 305866704, "15": 306536230, "16": 306940348, "17": 306459582, "18": 306452146, "19": ... | [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, 8... | 31,248,173,242 | 18.183984 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p00232 | s987198074 | s736868066 | train | cpp | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <s... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <s... | {"0": 1948817442, "1": 1948797708, "2": 1947402314, "3": 1950116740, "4": 1948724778, "5": 1950116740, "6": 1947402314, "7": 1950304642, "8": 1974682138, "9": 1933373156, "10": 1974682138, "11": 1974794250, "12": 1951302782, "13": 1976328354, "14": 1933373156, "15": 1941878510, "16": 1944472816, "17": 1942516862, "18":... | {"0": 1495912704, "1": 1495912704, "2": 1495703352, "3": 1495975910, "4": 1495703352, "5": 1495823472, "6": 1495979056, "7": 1495914134, "8": 1509026948, "9": 1495912704, "10": 1509026948, "11": 1509081574, "12": 1495979056, "13": 1508559624, "14": 1495703352, "15": 1495979056, "16": 1495912704, "17": 1495703352, "18":... | [] | [] | ok | ok | 200,457,093,980 | 153,503,785,864 | [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, 8... | [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, 8... | [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, 8... | 102 | 102 | 102 | 102 | 0 | 0 | 0 | 1.305877 | 1.305877 | 10.235758 | false | false | false | 0.198082 | 0.151866 | 1.304321 | 0.025842 | Accepted | Accepted | 0.025842 | 0.268323 | 0.17016 | 1 | 1 | s629291450 | {"0": 306676370, "1": 306676370, "2": 306598578, "3": 306675512, "4": 306676370, "5": 306593716, "6": 306848828, "7": 306043166, "8": 306676370, "9": 305969092, "10": 306957222, "11": 307045596, "12": 307043308, "13": 306536230, "14": 305866704, "15": 306536230, "16": 306940348, "17": 306459582, "18": 306452146, "19": ... | [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, 8... | 31,248,173,242 | 6.415002 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p00232 | s987198074 | s728528188 | train | cpp | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <s... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <s... | {"0": 1948817442, "1": 1948797708, "2": 1947402314, "3": 1950116740, "4": 1948724778, "5": 1950116740, "6": 1947402314, "7": 1950304642, "8": 1974682138, "9": 1933373156, "10": 1974682138, "11": 1974794250, "12": 1951302782, "13": 1976328354, "14": 1933373156, "15": 1941878510, "16": 1944472816, "17": 1942516862, "18":... | {"0": 1381849040, "1": 1381849040, "2": 1381877068, "3": 1382113018, "4": 1381863054, "5": 1382113018, "6": 1381340818, "7": 1381875352, "8": 1392487668, "9": 1381855046, "10": 1392487668, "11": 1392487668, "12": 1381856476, "13": 1392605214, "14": 1381847038, "15": 1381866200, "16": 1381857620, "17": 1381446638, "18":... | [] | [] | ok | ok | 200,457,093,980 | 141,605,533,212 | [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, 8... | [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, 8... | [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, 8... | 102 | 102 | 102 | 102 | 0 | 0 | 0 | 1.415602 | 1.415602 | 10.235758 | false | false | false | 0.198082 | 0.139113 | 1.423894 | 0.025842 | Accepted | Accepted | 0.025842 | 0.342365 | 0.18576 | 2 | 4 | s629291450 | {"0": 306676370, "1": 306676370, "2": 306598578, "3": 306675512, "4": 306676370, "5": 306593716, "6": 306848828, "7": 306043166, "8": 306676370, "9": 305969092, "10": 306957222, "11": 307045596, "12": 307043308, "13": 306536230, "14": 305866704, "15": 306536230, "16": 306940348, "17": 306459582, "18": 306452146, "19": ... | [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, 8... | 31,248,173,242 | 6.415002 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p00232 | s457062022 | s288098895 | train | cpp | #include<iostream>
#include<algorithm>
#define FOR(i,e) for(int i=0;i<(int)(e);i++)
using namespace std;
int main(){
double pb[100][5001];
int x,y,z;
int v[4],e[51],a[51];
while(cin >> x >> y >> z && (x||y||z)){
FOR(i,x)cin >> v[i];
FOR(i,y+1)e[i] = a[i] = 0;
FOR(i,z){
int n,... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
double pb[100][5001];
int x,y,z,n,m,l,ub;
int v[4],e[51],a[51];
while(cin >> x >> y >> z && (x||y||z)){
for(int i=0;i<x;i++)cin >> v[i];
for(int i=0;i<=y;i++)e[i] = a[i] = 0;
ub = 0;
for(int i=0;i<z;i++){
... | {"0": 1955512130, "1": 1955512130, "2": 1832175774, "3": 1955522140, "4": 1800679738, "5": 1955522140, "6": 1864193474, "7": 1800896526, "8": 1817884068, "9": 1832175774, "10": 1817859186, "11": 1972310912, "12": 1863720430, "13": 1912211730, "14": 1832165764, "15": 1800679738, "16": 1958029216, "17": 1800758102, "18":... | {"0": 1138490496, "1": 1138490496, "2": 1138490496, "3": 1138400978, "4": 1138490496, "5": 1138333768, "6": 1138948382, "7": 1138159022, "8": 1138641504, "9": 1138153588, "10": 1138992426, "11": 1139065356, "12": 1138641504, "13": 1138333768, "14": 1138008872, "15": 1138338916, "16": 1138490496, "17": 1138400978, "18":... | [] | [] | ok | ok | 192,160,987,590 | 116,110,849,712 | [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, 8... | [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, 8... | [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, 8... | 102 | 102 | 102 | 102 | 0 | 0 | 0 | 1.654979 | 1.654979 | 9.812142 | false | false | false | 0.189675 | 0.114226 | 1.660531 | 0.025842 | Accepted | Accepted | 0.025842 | 0.460525 | 0.226232 | 3 | 5 | s629291450 | {"0": 306676370, "1": 306676370, "2": 306598578, "3": 306675512, "4": 306676370, "5": 306593716, "6": 306848828, "7": 306043166, "8": 306676370, "9": 305969092, "10": 306957222, "11": 307045596, "12": 307043308, "13": 306536230, "14": 305866704, "15": 306536230, "16": 306940348, "17": 306459582, "18": 306452146, "19": ... | [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, 8... | 31,248,173,242 | 6.149511 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p00232 | s457062022 | s629291450 | train | cpp | #include<iostream>
#include<algorithm>
#define FOR(i,e) for(int i=0;i<(int)(e);i++)
using namespace std;
int main(){
double pb[100][5001];
int x,y,z;
int v[4],e[51],a[51];
while(cin >> x >> y >> z && (x||y||z)){
FOR(i,x)cin >> v[i];
FOR(i,y+1)e[i] = a[i] = 0;
FOR(i,z){
int n,... | #include<cstdio>
#include<algorithm>
using namespace std;
int main(){
double pb[100][5001];
int x,y,z,n,m,l,ub,i,j,k;
int v[4],e[51],a[51];
while(scanf("%d %d %d",&x,&y,&z) && (x||y||z)){
for(i=0;i<x;i++)scanf("%d",&v[i]);
for(i=0;i<=y;i++)e[i] = a[i] = 0;
ub = 0;
for(i=0;i<z;i+... | {"0": 1955512130, "1": 1955512130, "2": 1832175774, "3": 1955522140, "4": 1800679738, "5": 1955522140, "6": 1864193474, "7": 1800896526, "8": 1817884068, "9": 1832175774, "10": 1817859186, "11": 1972310912, "12": 1863720430, "13": 1912211730, "14": 1832165764, "15": 1800679738, "16": 1958029216, "17": 1800758102, "18":... | {"0": 306676370, "1": 306676370, "2": 306598578, "3": 306675512, "4": 306676370, "5": 306593716, "6": 306848828, "7": 306043166, "8": 306676370, "9": 305969092, "10": 306957222, "11": 307045596, "12": 307043308, "13": 306536230, "14": 305866704, "15": 306536230, "16": 306940348, "17": 306459582, "18": 306452146, "19": ... | [] | [] | ok | ok | 192,160,987,590 | 31,248,173,242 | [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, 8... | [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, 8... | [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, 8... | 102 | 102 | 102 | 102 | 0 | 0 | 0 | 6.149511 | 6.149511 | 9.812142 | false | false | false | 0.189675 | 0.030367 | 6.246177 | 0.025842 | Accepted | Accepted | 0.025842 | 0.97238 | 0.850984 | 6 | 6 | s629291450 | {"0": 306676370, "1": 306676370, "2": 306598578, "3": 306675512, "4": 306676370, "5": 306593716, "6": 306848828, "7": 306043166, "8": 306676370, "9": 305969092, "10": 306957222, "11": 307045596, "12": 307043308, "13": 306536230, "14": 305866704, "15": 306536230, "16": 306940348, "17": 306459582, "18": 306452146, "19": ... | [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, 8... | 31,248,173,242 | 6.149511 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p00232 | s288098895 | s629291450 | train | cpp | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
double pb[100][5001];
int x,y,z,n,m,l,ub;
int v[4],e[51],a[51];
while(cin >> x >> y >> z && (x||y||z)){
for(int i=0;i<x;i++)cin >> v[i];
for(int i=0;i<=y;i++)e[i] = a[i] = 0;
ub = 0;
for(int i=0;i<z;i++){
... | #include<cstdio>
#include<algorithm>
using namespace std;
int main(){
double pb[100][5001];
int x,y,z,n,m,l,ub,i,j,k;
int v[4],e[51],a[51];
while(scanf("%d %d %d",&x,&y,&z) && (x||y||z)){
for(i=0;i<x;i++)scanf("%d",&v[i]);
for(i=0;i<=y;i++)e[i] = a[i] = 0;
ub = 0;
for(i=0;i<z;i+... | {"0": 1138490496, "1": 1138490496, "2": 1138490496, "3": 1138400978, "4": 1138490496, "5": 1138333768, "6": 1138948382, "7": 1138159022, "8": 1138641504, "9": 1138153588, "10": 1138992426, "11": 1139065356, "12": 1138641504, "13": 1138333768, "14": 1138008872, "15": 1138338916, "16": 1138490496, "17": 1138400978, "18":... | {"0": 306676370, "1": 306676370, "2": 306598578, "3": 306675512, "4": 306676370, "5": 306593716, "6": 306848828, "7": 306043166, "8": 306676370, "9": 305969092, "10": 306957222, "11": 307045596, "12": 307043308, "13": 306536230, "14": 305866704, "15": 306536230, "16": 306940348, "17": 306459582, "18": 306452146, "19": ... | [] | [] | ok | ok | 116,110,849,712 | 31,248,173,242 | [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, 8... | [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, 8... | [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, 8... | 102 | 102 | 102 | 102 | 0 | 0 | 0 | 3.715764 | 3.715764 | 5.928863 | false | false | false | 0.114226 | 0.030367 | 3.761555 | 0.025842 | Accepted | Accepted | 0.025842 | 0.948802 | 0.850984 | 6 | 6 | s629291450 | {"0": 306676370, "1": 306676370, "2": 306598578, "3": 306675512, "4": 306676370, "5": 306593716, "6": 306848828, "7": 306043166, "8": 306676370, "9": 305969092, "10": 306957222, "11": 307045596, "12": 307043308, "13": 306536230, "14": 305866704, "15": 306536230, "16": 306940348, "17": 306459582, "18": 306452146, "19": ... | [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, 8... | 31,248,173,242 | 3.715764 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p00232 | s441517966 | s945344504 | train | cpp | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typ... | {"0": 1912165684, "1": 1912171118, "2": 1912085890, "3": 1911756132, "4": 1911754416, "5": 1911724672, "6": 1911761566, "7": 1912032980, "8": 1939691468, "9": 1912132508, "10": 1939691468, "11": 1939242448, "12": 1912373892, "13": 1938678456, "14": 1911924872, "15": 1911747266, "16": 1912106196, "17": 1912026116, "18":... | {"0": 1492878530, "1": 1492880532, "2": 1492896262, "3": 1492976628, "4": 1492929724, "5": 1492994932, "6": 1492965474, "7": 1492980918, "8": 1506695190, "9": 1492897978, "10": 1506695190, "11": 1506616826, "12": 1493041264, "13": 1506602812, "14": 1492913422, "15": 1492878530, "16": 1492945454, "17": 1492902554, "18":... | [] | [] | ok | ok | 196,948,587,550 | 153,258,115,868 | [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, 8... | [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, 8... | [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, 8... | 102 | 102 | 102 | 102 | 0 | 0 | 0 | 1.285078 | 1.285078 | 10.056607 | false | false | false | 0.194465 | 0.151179 | 1.286329 | 0.025842 | Accepted | Accepted | 0.025842 | 0.256706 | 0.170934 | 1 | 1 | s629291450 | {"0": 306676370, "1": 306676370, "2": 306598578, "3": 306675512, "4": 306676370, "5": 306593716, "6": 306848828, "7": 306043166, "8": 306676370, "9": 305969092, "10": 306957222, "11": 307045596, "12": 307043308, "13": 306536230, "14": 305866704, "15": 306536230, "16": 306940348, "17": 306459582, "18": 306452146, "19": ... | [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, 8... | 31,248,173,242 | 6.302723 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s258228842 | s043585867 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T> constexpr T inf = numeric_limits<T>::has_infinity ? numeric_limits<T>::infinity() : numeric_limits<T>::max() / 4;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) f... | // #include <bits/stdc++.h>
#include <cstdio>
#include <vector>
#include <functional>
#include <algorithm>
#include <queue>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < ... | {"0": 1047497594, "1": 1086782840, "2": 1085789848, "3": 1084804864, "4": 1084811442, "5": 1085419478, "6": 1085751524, "7": 1085945718, "8": 1085141486, "9": 1085437496, "10": 1085333964, "11": 1085872216, "12": 1084797428, "13": 1083601662, "14": 1085166082, "15": 1085411470, "16": 1085434064, "17": 1084798000, "18":... | {"0": 948173798, "1": 970277022, "2": 970611356, "3": 972436608, "4": 970890206, "5": 970363394, "6": 971952410, "7": 972409152, "8": 971577178, "9": 972004176, "10": 972662262, "11": 970373404, "12": 972396282, "13": 971554870, "14": 971993308, "15": 970037926, "16": 970865610, "17": 971564594, "18": 972410296, "19": ... | [] | [] | ok | ok | 112,675,700,280 | 101,004,537,920 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.115551 | 1.115551 | 5.642814 | false | false | false | 0.112089 | 0.100619 | 1.113994 | 0.020439 | Accepted | Accepted | 0.020439 | 0.125149 | 0.203133 | 1 | 5 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.419142 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s472072770 | s043585867 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; i-- > 0;)
#define ALL(v) (v).begin(), (v).end()... | // #include <bits/stdc++.h>
#include <cstdio>
#include <vector>
#include <functional>
#include <algorithm>
#include <queue>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < ... | {"0": 1050012392, "1": 1076801726, "2": 1076694190, "3": 1077015940, "4": 1076346414, "5": 1076905544, "6": 1078247170, "7": 1078112464, "8": 1077409476, "9": 1078174526, "10": 1078778272, "11": 1075952878, "12": 1077409190, "13": 1076693904, "14": 1078367576, "15": 1075543326, "16": 1076610392, "17": 1077015940, "18":... | {"0": 948173798, "1": 970277022, "2": 970611356, "3": 972436608, "4": 970890206, "5": 970363394, "6": 971952410, "7": 972409152, "8": 971577178, "9": 972004176, "10": 972662262, "11": 970373404, "12": 972396282, "13": 971554870, "14": 971993308, "15": 970037926, "16": 970865610, "17": 971564594, "18": 972410296, "19": ... | [] | [] | ok | ok | 111,976,610,746 | 101,004,537,920 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.10863 | 1.10863 | 5.607803 | false | false | false | 0.111342 | 0.100619 | 1.10657 | 0.020439 | Accepted | Accepted | 0.020439 | 0.11796 | 0.203133 | 1 | 5 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.38552 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s139408187 | s043585867 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; i-- > 0;)
#define ALL(v) (v).begin(), (v).end()... | // #include <bits/stdc++.h>
#include <cstdio>
#include <vector>
#include <functional>
#include <algorithm>
#include <queue>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < ... | {"0": 1037650042, "1": 1077698622, "2": 1077825892, "3": 1078243452, "4": 1077130912, "5": 1077722646, "6": 1079359424, "7": 1078447084, "8": 1078453376, "9": 1079000494, "10": 1079261612, "11": 1076916698, "12": 1077848486, "13": 1077709204, "14": 1079125476, "15": 1076489128, "16": 1077819028, "17": 1077716926, "18":... | {"0": 948173798, "1": 970277022, "2": 970611356, "3": 972436608, "4": 970890206, "5": 970363394, "6": 971952410, "7": 972409152, "8": 971577178, "9": 972004176, "10": 972662262, "11": 970373404, "12": 972396282, "13": 971554870, "14": 971993308, "15": 970037926, "16": 970865610, "17": 971564594, "18": 972410296, "19": ... | [] | [] | ok | ok | 111,983,324,310 | 101,004,537,920 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.108696 | 1.108696 | 5.608139 | false | false | false | 0.111319 | 0.100619 | 1.106341 | 0.020439 | Accepted | Accepted | 0.020439 | 0.117737 | 0.203133 | 1 | 5 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.385843 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s557761618 | s779400339 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T> constexpr T inf = numeric_limits<T>::has_infinity ? numeric_limits<T>::infinity() : numeric_limits<T>::max() / 4;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) f... | #include <cstdio>
#include <vector>
#include <functional>
#include <algorithm>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = ... | {"0": 1046499454, "1": 1070867512, "2": 1070579224, "3": 1070202562, "4": 1071095740, "5": 1070602962, "6": 1072573502, "7": 1071449236, "8": 1071663450, "9": 1071444660, "10": 1073077720, "11": 1070916418, "12": 1069873662, "13": 1070583228, "14": 1071279924, "15": 1070561778, "16": 1070440800, "17": 1070560348, "18":... | {"0": 947139050, "1": 965871192, "2": 965369834, "3": 966026490, "4": 966149184, "5": 966492956, "6": 967812560, "7": 968194656, "8": 966771806, "9": 967458492, "10": 967335798, "11": 965467360, "12": 966689724, "13": 966579900, "14": 967626088, "15": 965353246, "16": 966026490, "17": 965472222, "18": 967900648, "19": ... | [] | [] | ok | ok | 111,299,679,634 | 100,482,176,938 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.107656 | 1.107656 | 5.573902 | false | false | false | 0.110618 | 0.100345 | 1.102373 | 0.020439 | Accepted | Accepted | 0.020439 | 0.113914 | 0.203687 | 1 | 5 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.352963 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s258228842 | s779400339 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T> constexpr T inf = numeric_limits<T>::has_infinity ? numeric_limits<T>::infinity() : numeric_limits<T>::max() / 4;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) f... | #include <cstdio>
#include <vector>
#include <functional>
#include <algorithm>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = ... | {"0": 1047497594, "1": 1086782840, "2": 1085789848, "3": 1084804864, "4": 1084811442, "5": 1085419478, "6": 1085751524, "7": 1085945718, "8": 1085141486, "9": 1085437496, "10": 1085333964, "11": 1085872216, "12": 1084797428, "13": 1083601662, "14": 1085166082, "15": 1085411470, "16": 1085434064, "17": 1084798000, "18":... | {"0": 947139050, "1": 965871192, "2": 965369834, "3": 966026490, "4": 966149184, "5": 966492956, "6": 967812560, "7": 968194656, "8": 966771806, "9": 967458492, "10": 967335798, "11": 965467360, "12": 966689724, "13": 966579900, "14": 967626088, "15": 965353246, "16": 966026490, "17": 965472222, "18": 967900648, "19": ... | [] | [] | ok | ok | 112,675,700,280 | 100,482,176,938 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.12135 | 1.12135 | 5.642814 | false | false | false | 0.112089 | 0.100345 | 1.117033 | 0.020439 | Accepted | Accepted | 0.020439 | 0.128137 | 0.203687 | 1 | 5 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.419142 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s472072770 | s779400339 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; i-- > 0;)
#define ALL(v) (v).begin(), (v).end()... | #include <cstdio>
#include <vector>
#include <functional>
#include <algorithm>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = ... | {"0": 1050012392, "1": 1076801726, "2": 1076694190, "3": 1077015940, "4": 1076346414, "5": 1076905544, "6": 1078247170, "7": 1078112464, "8": 1077409476, "9": 1078174526, "10": 1078778272, "11": 1075952878, "12": 1077409190, "13": 1076693904, "14": 1078367576, "15": 1075543326, "16": 1076610392, "17": 1077015940, "18":... | {"0": 947139050, "1": 965871192, "2": 965369834, "3": 966026490, "4": 966149184, "5": 966492956, "6": 967812560, "7": 968194656, "8": 966771806, "9": 967458492, "10": 967335798, "11": 965467360, "12": 966689724, "13": 966579900, "14": 967626088, "15": 965353246, "16": 966026490, "17": 965472222, "18": 967900648, "19": ... | [] | [] | ok | ok | 111,976,610,746 | 100,482,176,938 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.114393 | 1.114393 | 5.607803 | false | false | false | 0.111342 | 0.100345 | 1.109589 | 0.020439 | Accepted | Accepted | 0.020439 | 0.120972 | 0.203687 | 1 | 5 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.38552 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s139408187 | s779400339 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; i-- > 0;)
#define ALL(v) (v).begin(), (v).end()... | #include <cstdio>
#include <vector>
#include <functional>
#include <algorithm>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = ... | {"0": 1037650042, "1": 1077698622, "2": 1077825892, "3": 1078243452, "4": 1077130912, "5": 1077722646, "6": 1079359424, "7": 1078447084, "8": 1078453376, "9": 1079000494, "10": 1079261612, "11": 1076916698, "12": 1077848486, "13": 1077709204, "14": 1079125476, "15": 1076489128, "16": 1077819028, "17": 1077716926, "18":... | {"0": 947139050, "1": 965871192, "2": 965369834, "3": 966026490, "4": 966149184, "5": 966492956, "6": 967812560, "7": 968194656, "8": 966771806, "9": 967458492, "10": 967335798, "11": 965467360, "12": 966689724, "13": 966579900, "14": 967626088, "15": 965353246, "16": 966026490, "17": 965472222, "18": 967900648, "19": ... | [] | [] | ok | ok | 111,983,324,310 | 100,482,176,938 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.11446 | 1.11446 | 5.608139 | false | false | false | 0.111319 | 0.100345 | 1.109359 | 0.020439 | Accepted | Accepted | 0.020439 | 0.120749 | 0.203687 | 1 | 5 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.385843 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s557761618 | s634610038 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T> constexpr T inf = numeric_limits<T>::has_infinity ? numeric_limits<T>::infinity() : numeric_limits<T>::max() / 4;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) f... | #include <cstdio>
#include <algorithm>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
if (c & 16) {
a = a * ... | {"0": 1046499454, "1": 1070867512, "2": 1070579224, "3": 1070202562, "4": 1071095740, "5": 1070602962, "6": 1072573502, "7": 1071449236, "8": 1071663450, "9": 1071444660, "10": 1073077720, "11": 1070916418, "12": 1069873662, "13": 1070583228, "14": 1071279924, "15": 1070561778, "16": 1070440800, "17": 1070560348, "18":... | {"0": 951964728, "1": 969314918, "2": 968794684, "3": 969386132, "4": 969162194, "5": 969320638, "6": 970833292, "7": 971141886, "8": 969760220, "9": 970278738, "10": 969330076, "11": 969307196, "12": 968782672, "13": 969359820, "14": 970201232, "15": 969325786, "16": 968721754, "17": 968792968, "18": 970356816, "19": ... | [] | [] | ok | ok | 111,299,679,634 | 100,786,967,996 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.104306 | 1.104306 | 5.573902 | false | false | false | 0.110618 | 0.099604 | 1.110574 | 0.020439 | Accepted | Accepted | 0.020439 | 0.122132 | 0.205203 | 1 | 5 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.352963 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s258228842 | s634610038 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T> constexpr T inf = numeric_limits<T>::has_infinity ? numeric_limits<T>::infinity() : numeric_limits<T>::max() / 4;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) f... | #include <cstdio>
#include <algorithm>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
if (c & 16) {
a = a * ... | {"0": 1047497594, "1": 1086782840, "2": 1085789848, "3": 1084804864, "4": 1084811442, "5": 1085419478, "6": 1085751524, "7": 1085945718, "8": 1085141486, "9": 1085437496, "10": 1085333964, "11": 1085872216, "12": 1084797428, "13": 1083601662, "14": 1085166082, "15": 1085411470, "16": 1085434064, "17": 1084798000, "18":... | {"0": 951964728, "1": 969314918, "2": 968794684, "3": 969386132, "4": 969162194, "5": 969320638, "6": 970833292, "7": 971141886, "8": 969760220, "9": 970278738, "10": 969330076, "11": 969307196, "12": 968782672, "13": 969359820, "14": 970201232, "15": 969325786, "16": 968721754, "17": 968792968, "18": 970356816, "19": ... | [] | [] | ok | ok | 112,675,700,280 | 100,786,967,996 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.117959 | 1.117959 | 5.642814 | false | false | false | 0.112089 | 0.099604 | 1.125344 | 0.020439 | Accepted | Accepted | 0.020439 | 0.136222 | 0.205203 | 1 | 5 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.419142 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s472072770 | s634610038 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; i-- > 0;)
#define ALL(v) (v).begin(), (v).end()... | #include <cstdio>
#include <algorithm>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
if (c & 16) {
a = a * ... | {"0": 1050012392, "1": 1076801726, "2": 1076694190, "3": 1077015940, "4": 1076346414, "5": 1076905544, "6": 1078247170, "7": 1078112464, "8": 1077409476, "9": 1078174526, "10": 1078778272, "11": 1075952878, "12": 1077409190, "13": 1076693904, "14": 1078367576, "15": 1075543326, "16": 1076610392, "17": 1077015940, "18":... | {"0": 951964728, "1": 969314918, "2": 968794684, "3": 969386132, "4": 969162194, "5": 969320638, "6": 970833292, "7": 971141886, "8": 969760220, "9": 970278738, "10": 969330076, "11": 969307196, "12": 968782672, "13": 969359820, "14": 970201232, "15": 969325786, "16": 968721754, "17": 968792968, "18": 970356816, "19": ... | [] | [] | ok | ok | 111,976,610,746 | 100,786,967,996 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.111023 | 1.111023 | 5.607803 | false | false | false | 0.111342 | 0.099604 | 1.117844 | 0.020439 | Accepted | Accepted | 0.020439 | 0.129124 | 0.205203 | 1 | 5 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.38552 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s696792025 | s634610038 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; i-- > 0;)
#define ALL(v) (v).begin(), (v).end()... | #include <cstdio>
#include <algorithm>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
if (c & 16) {
a = a * ... | {"0": 1047459842, "1": 1068344706, "2": 1068751970, "3": 1066391898, "4": 1066210002, "5": 1067397474, "6": 1066607828, "7": 1067824186, "8": 1067441518, "9": 1067824186, "10": 1067602250, "11": 1070391894, "12": 1066413920, "13": 1065645438, "14": 1068553772, "15": 1069617692, "16": 1068992210, "17": 1065633426, "18":... | {"0": 951964728, "1": 969314918, "2": 968794684, "3": 969386132, "4": 969162194, "5": 969320638, "6": 970833292, "7": 971141886, "8": 969760220, "9": 970278738, "10": 969330076, "11": 969307196, "12": 968782672, "13": 969359820, "14": 970201232, "15": 969325786, "16": 968721754, "17": 968792968, "18": 970356816, "19": ... | [] | [] | ok | ok | 110,962,151,872 | 100,786,967,996 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.100957 | 1.100957 | 5.556999 | false | false | false | 0.110142 | 0.099604 | 1.105799 | 0.020439 | Accepted | Accepted | 0.020439 | 0.117477 | 0.205203 | 1 | 5 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.336729 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s139408187 | s634610038 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; i-- > 0;)
#define ALL(v) (v).begin(), (v).end()... | #include <cstdio>
#include <algorithm>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
if (c & 16) {
a = a * ... | {"0": 1037650042, "1": 1077698622, "2": 1077825892, "3": 1078243452, "4": 1077130912, "5": 1077722646, "6": 1079359424, "7": 1078447084, "8": 1078453376, "9": 1079000494, "10": 1079261612, "11": 1076916698, "12": 1077848486, "13": 1077709204, "14": 1079125476, "15": 1076489128, "16": 1077819028, "17": 1077716926, "18":... | {"0": 951964728, "1": 969314918, "2": 968794684, "3": 969386132, "4": 969162194, "5": 969320638, "6": 970833292, "7": 971141886, "8": 969760220, "9": 970278738, "10": 969330076, "11": 969307196, "12": 968782672, "13": 969359820, "14": 970201232, "15": 969325786, "16": 968721754, "17": 968792968, "18": 970356816, "19": ... | [] | [] | ok | ok | 111,983,324,310 | 100,786,967,996 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.111089 | 1.111089 | 5.608139 | false | false | false | 0.111319 | 0.099604 | 1.117613 | 0.020439 | Accepted | Accepted | 0.020439 | 0.128903 | 0.205203 | 1 | 5 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.385843 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s040926137 | s634610038 | train | cpp | #include <bits/stdc++.h>
using namespace std;
// using i32 = std::int_fast32_t;
// using i64 = std::int_fast64_t;
using i32 = int;
using i64 = long long;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; ... | #include <cstdio>
#include <algorithm>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
if (c & 16) {
a = a * ... | {"0": 1037497032, "1": 1066117910, "2": 1066087308, "3": 1066585234, "4": 1066127348, "5": 1066061568, "6": 1068141074, "7": 1068257762, "8": 1068009800, "9": 1068213146, "10": 1068252614, "11": 1065790154, "12": 1066498004, "13": 1065856792, "14": 1068319824, "15": 1065575082, "16": 1066136214, "17": 1066620698, "18":... | {"0": 951964728, "1": 969314918, "2": 968794684, "3": 969386132, "4": 969162194, "5": 969320638, "6": 970833292, "7": 971141886, "8": 969760220, "9": 970278738, "10": 969330076, "11": 969307196, "12": 968782672, "13": 969359820, "14": 970201232, "15": 969325786, "16": 968721754, "17": 968792968, "18": 970356816, "19": ... | [] | [] | ok | ok | 110,908,813,730 | 100,786,967,996 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.100428 | 1.100428 | 5.554328 | false | false | false | 0.109955 | 0.099604 | 1.103926 | 0.020439 | Accepted | Accepted | 0.020439 | 0.115637 | 0.205203 | 1 | 5 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.334164 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s557761618 | s669931122 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T> constexpr T inf = numeric_limits<T>::has_infinity ? numeric_limits<T>::infinity() : numeric_limits<T>::max() / 4;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) f... | #include <cstdio>
#include <algorithm>
#include <functional>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (register int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
... | {"0": 1046499454, "1": 1070867512, "2": 1070579224, "3": 1070202562, "4": 1071095740, "5": 1070602962, "6": 1072573502, "7": 1071449236, "8": 1071663450, "9": 1071444660, "10": 1073077720, "11": 1070916418, "12": 1069873662, "13": 1070583228, "14": 1071279924, "15": 1070561778, "16": 1070440800, "17": 1070560348, "18":... | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [] | [] | ok | ok | 111,299,679,634 | 20,792,164,536 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 5.352963 | 5.352963 | 5.573902 | false | false | false | 0.110618 | 0.020439 | 5.412083 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 1 | 10 | 10 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.352963 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s258228842 | s669931122 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T> constexpr T inf = numeric_limits<T>::has_infinity ? numeric_limits<T>::infinity() : numeric_limits<T>::max() / 4;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) f... | #include <cstdio>
#include <algorithm>
#include <functional>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (register int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
... | {"0": 1047497594, "1": 1086782840, "2": 1085789848, "3": 1084804864, "4": 1084811442, "5": 1085419478, "6": 1085751524, "7": 1085945718, "8": 1085141486, "9": 1085437496, "10": 1085333964, "11": 1085872216, "12": 1084797428, "13": 1083601662, "14": 1085166082, "15": 1085411470, "16": 1085434064, "17": 1084798000, "18":... | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [] | [] | ok | ok | 112,675,700,280 | 20,792,164,536 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 5.419142 | 5.419142 | 5.642814 | false | false | false | 0.112089 | 0.020439 | 5.484056 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 1 | 10 | 10 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.419142 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s472072770 | s669931122 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; i-- > 0;)
#define ALL(v) (v).begin(), (v).end()... | #include <cstdio>
#include <algorithm>
#include <functional>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (register int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
... | {"0": 1050012392, "1": 1076801726, "2": 1076694190, "3": 1077015940, "4": 1076346414, "5": 1076905544, "6": 1078247170, "7": 1078112464, "8": 1077409476, "9": 1078174526, "10": 1078778272, "11": 1075952878, "12": 1077409190, "13": 1076693904, "14": 1078367576, "15": 1075543326, "16": 1076610392, "17": 1077015940, "18":... | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [] | [] | ok | ok | 111,976,610,746 | 20,792,164,536 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 5.38552 | 5.38552 | 5.607803 | false | false | false | 0.111342 | 0.020439 | 5.447509 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 1 | 10 | 10 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.38552 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s696792025 | s669931122 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; i-- > 0;)
#define ALL(v) (v).begin(), (v).end()... | #include <cstdio>
#include <algorithm>
#include <functional>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (register int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
... | {"0": 1047459842, "1": 1068344706, "2": 1068751970, "3": 1066391898, "4": 1066210002, "5": 1067397474, "6": 1066607828, "7": 1067824186, "8": 1067441518, "9": 1067824186, "10": 1067602250, "11": 1070391894, "12": 1066413920, "13": 1065645438, "14": 1068553772, "15": 1069617692, "16": 1068992210, "17": 1065633426, "18":... | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [] | [] | ok | ok | 110,962,151,872 | 20,792,164,536 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 5.336729 | 5.336729 | 5.556999 | false | false | false | 0.110142 | 0.020439 | 5.388813 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 1 | 10 | 10 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.336729 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s139408187 | s669931122 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; i-- > 0;)
#define ALL(v) (v).begin(), (v).end()... | #include <cstdio>
#include <algorithm>
#include <functional>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (register int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
... | {"0": 1037650042, "1": 1077698622, "2": 1077825892, "3": 1078243452, "4": 1077130912, "5": 1077722646, "6": 1079359424, "7": 1078447084, "8": 1078453376, "9": 1079000494, "10": 1079261612, "11": 1076916698, "12": 1077848486, "13": 1077709204, "14": 1079125476, "15": 1076489128, "16": 1077819028, "17": 1077716926, "18":... | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [] | [] | ok | ok | 111,983,324,310 | 20,792,164,536 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 5.385843 | 5.385843 | 5.608139 | false | false | false | 0.111319 | 0.020439 | 5.446382 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 1 | 10 | 10 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.385843 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s040926137 | s669931122 | train | cpp | #include <bits/stdc++.h>
using namespace std;
// using i32 = std::int_fast32_t;
// using i64 = std::int_fast64_t;
using i32 = int;
using i64 = long long;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; ... | #include <cstdio>
#include <algorithm>
#include <functional>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (register int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
... | {"0": 1037497032, "1": 1066117910, "2": 1066087308, "3": 1066585234, "4": 1066127348, "5": 1066061568, "6": 1068141074, "7": 1068257762, "8": 1068009800, "9": 1068213146, "10": 1068252614, "11": 1065790154, "12": 1066498004, "13": 1065856792, "14": 1068319824, "15": 1065575082, "16": 1066136214, "17": 1066620698, "18":... | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [] | [] | ok | ok | 110,908,813,730 | 20,792,164,536 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 5.334164 | 5.334164 | 5.554328 | false | false | false | 0.109955 | 0.020439 | 5.379684 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 1 | 10 | 10 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 5.334164 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s375569918 | s669931122 | train | cpp | // #include <bits/stdc++.h>
#include <cstdio>
#include <vector>
#include <functional>
#include <algorithm>
#include <queue>
#include <set>
using namespace std;
// using i32 = std::int_fast32_t;
// using i64 = std::int_fast64_t;
using i32 = int;
using i64 = long long;
#define REP(i, stop) FOR(i, 0, stop)... | #include <cstdio>
#include <algorithm>
#include <functional>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (register int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
... | {"0": 953426760, "1": 982629362, "2": 983215662, "3": 982809542, "4": 981838000, "5": 982569016, "6": 984263852, "7": 983651812, "8": 983690708, "9": 984361664, "10": 984517534, "11": 982366242, "12": 983055502, "13": 982814404, "14": 984577594, "15": 981958120, "16": 983244834, "17": 982506382, "18": 984266426, "19": ... | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [] | [] | ok | ok | 102,193,936,988 | 20,792,164,536 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 4.915022 | 4.915022 | 5.117885 | false | false | false | 0.101962 | 0.020439 | 4.988615 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 1 | 10 | 10 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 4.915022 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s043585867 | s669931122 | train | cpp | // #include <bits/stdc++.h>
#include <cstdio>
#include <vector>
#include <functional>
#include <algorithm>
#include <queue>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < ... | #include <cstdio>
#include <algorithm>
#include <functional>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (register int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
... | {"0": 948173798, "1": 970277022, "2": 970611356, "3": 972436608, "4": 970890206, "5": 970363394, "6": 971952410, "7": 972409152, "8": 971577178, "9": 972004176, "10": 972662262, "11": 970373404, "12": 972396282, "13": 971554870, "14": 971993308, "15": 970037926, "16": 970865610, "17": 971564594, "18": 972410296, "19": ... | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [] | [] | ok | ok | 101,004,537,920 | 20,792,164,536 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 4.857817 | 4.857817 | 5.05832 | false | false | false | 0.100619 | 0.020439 | 4.92288 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 1 | 10 | 10 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 4.857817 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s779400339 | s669931122 | train | cpp | #include <cstdio>
#include <vector>
#include <functional>
#include <algorithm>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = ... | #include <cstdio>
#include <algorithm>
#include <functional>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (register int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
... | {"0": 947139050, "1": 965871192, "2": 965369834, "3": 966026490, "4": 966149184, "5": 966492956, "6": 967812560, "7": 968194656, "8": 966771806, "9": 967458492, "10": 967335798, "11": 965467360, "12": 966689724, "13": 966579900, "14": 967626088, "15": 965353246, "16": 966026490, "17": 965472222, "18": 967900648, "19": ... | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [] | [] | ok | ok | 100,482,176,938 | 20,792,164,536 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 4.832694 | 4.832694 | 5.03216 | false | false | false | 0.100345 | 0.020439 | 4.909485 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 1 | 10 | 10 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 4.832694 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s634610038 | s669931122 | train | cpp | #include <cstdio>
#include <algorithm>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
if (c & 16) {
a = a * ... | #include <cstdio>
#include <algorithm>
#include <functional>
#include <set>
using namespace std;
using i32 = int;
using i64 = long long;
#define REP(i, stop) for (register int i = 0; i < stop; ++i)
template<typename T>
T read() {
T a = 0;
register int c;
for(;;) {
c = getchar_unlocked();
... | {"0": 951964728, "1": 969314918, "2": 968794684, "3": 969386132, "4": 969162194, "5": 969320638, "6": 970833292, "7": 971141886, "8": 969760220, "9": 970278738, "10": 969330076, "11": 969307196, "12": 968782672, "13": 969359820, "14": 970201232, "15": 969325786, "16": 968721754, "17": 968792968, "18": 970356816, "19": ... | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [] | [] | ok | ok | 100,786,967,996 | 20,792,164,536 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 4.847353 | 4.847353 | 5.047424 | false | false | false | 0.099604 | 0.020439 | 4.873229 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 1 | 10 | 10 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 4.847353 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s058173302 | s014360762 | train | cpp | #include <bits/stdc++.h>
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000000000000;
const double EPS = 1e-10;
const pair<int,int> fd[] = {make_pair(1,0),make_pair(-1... | #include <bits/stdc++.h>
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int,int> fd[] = {make_pair(1,0),make_pair(-1,0),make_... | {"0": 3883285978, "1": 3921376030, "2": 3920989072, "3": 3922108190, "4": 3921503300, "5": 3921805030, "6": 3923356580, "7": 3922802884, "8": 3923140364, "9": 3922478846, "10": 3922572654, "11": 3921219302, "12": 3921962330, "13": 3922480276, "14": 3923273068, "15": 3921312252, "16": 3920920146, "17": 3922187412, "18":... | {"0": 1033567964, "1": 1065656020, "2": 1065517024, "3": 1065183548, "4": 1065648012, "5": 1065730666, "6": 1066483418, "7": 1065831624, "8": 1065828478, "9": 1066086164, "10": 1066071292, "11": 1065478128, "12": 1065845924, "13": 1065316538, "14": 1065860796, "15": 1065831052, "16": 1065772708, "17": 1065650300, "18":... | [] | [] | ok | ok | 407,746,987,648 | 110,711,847,532 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 3.682957 | 3.682957 | 20.420021 | false | false | false | 0.40751 | 0.110141 | 3.699894 | 0.020439 | Accepted | Accepted | 0.020439 | 0.768254 | 0.185571 | 4 | 4 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 19.610608 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s176788640 | s379376946 | train | cpp | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using namespace std;
struct P {
ll taste;
int a;
int b;
int c;
bool operator<(const P &another) const {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
vector<ll> AB;
vector<ll> ans;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<ll> B(Y);
vector<ll> ... | {"0": 1163914180, "1": 1213125914, "2": 1213326686, "3": 1214120622, "4": 1213806594, "5": 1214110326, "6": 1216510438, "7": 1217639280, "8": 1216158086, "9": 1216354282, "10": 1216268768, "11": 1212617692, "12": 1215062706, "13": 1215028958, "14": 1216577076, "15": 1211677038, "16": 1213271774, "17": 1214140642, "18":... | {"0": 1038459136, "1": 1080805440, "2": 1080222572, "3": 1080187108, "4": 1080348698, "5": 1081225288, "6": 1083039958, "7": 1082721354, "8": 1081702336, "9": 1082096158, "10": 1082115892, "11": 1080282918, "12": 1080210274, "13": 1081758106, "14": 1081777268, "15": 1080231724, "16": 1081454088, "17": 1080300650, "18":... | [] | [] | ok | ok | 126,188,168,392 | 112,275,321,158 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.123917 | 1.123917 | 6.31952 | false | false | false | 0.125707 | 0.111738 | 1.125017 | 0.020439 | Accepted | Accepted | 0.020439 | 0.1327 | 0.18292 | 1 | 3 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 6.069025 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s231332085 | s379376946 | train | cpp | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using namespace std;
struct P {
ll taste;
int a;
int b;
int c;
bool operator<(const P &d) const {
if (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
vector<ll> AB;
vector<ll> ans;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<ll> B(Y);
vector<ll> ... | {"0": 1162009706, "1": 1205956466, "2": 1205711364, "3": 1207738818, "4": 1206027966, "5": 1206095176, "6": 1208791584, "7": 1208791584, "8": 1208416638, "9": 1208791584, "10": 1208478700, "11": 1205560642, "12": 1207294660, "13": 1207627278, "14": 1208577656, "15": 1204816470, "16": 1205356152, "17": 1205970194, "18":... | {"0": 1038459136, "1": 1080805440, "2": 1080222572, "3": 1080187108, "4": 1080348698, "5": 1081225288, "6": 1083039958, "7": 1082721354, "8": 1081702336, "9": 1082096158, "10": 1082115892, "11": 1080282918, "12": 1080210274, "13": 1081758106, "14": 1081777268, "15": 1080231724, "16": 1081454088, "17": 1080300650, "18":... | [] | [] | ok | ok | 125,415,333,758 | 112,275,321,158 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.117034 | 1.117034 | 6.280816 | false | false | false | 0.124862 | 0.111738 | 1.117458 | 0.020439 | Accepted | Accepted | 0.020439 | 0.125686 | 0.18292 | 1 | 3 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 6.031856 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s176788640 | s386168718 | train | cpp | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using namespace std;
struct P {
ll taste;
int a;
int b;
int c;
bool operator<(const P &another) const {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
vector<ll> AB;
vector<ll> ans;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<ll> B(Y);
vector<ll> ... | {"0": 1163914180, "1": 1213125914, "2": 1213326686, "3": 1214120622, "4": 1213806594, "5": 1214110326, "6": 1216510438, "7": 1217639280, "8": 1216158086, "9": 1216354282, "10": 1216268768, "11": 1212617692, "12": 1215062706, "13": 1215028958, "14": 1216577076, "15": 1211677038, "16": 1213271774, "17": 1214140642, "18":... | {"0": 1037919454, "1": 1079725504, "2": 1079329966, "3": 1079138346, "4": 1079806728, "5": 1079251888, "6": 1081075138, "7": 1081318238, "8": 1080226290, "9": 1081014220, "10": 1080183104, "11": 1079693472, "12": 1079133198, "13": 1079342264, "14": 1081384590, "15": 1080016366, "16": 1079726934, "17": 1080831466, "18":... | [] | [] | ok | ok | 126,188,168,392 | 112,172,100,326 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.124951 | 1.124951 | 6.31952 | false | false | false | 0.125707 | 0.111843 | 1.123953 | 0.020439 | Accepted | Accepted | 0.020439 | 0.131696 | 0.182747 | 1 | 3 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 6.069025 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s231332085 | s386168718 | train | cpp | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using namespace std;
struct P {
ll taste;
int a;
int b;
int c;
bool operator<(const P &d) const {
if (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
vector<ll> AB;
vector<ll> ans;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<ll> B(Y);
vector<ll> ... | {"0": 1162009706, "1": 1205956466, "2": 1205711364, "3": 1207738818, "4": 1206027966, "5": 1206095176, "6": 1208791584, "7": 1208791584, "8": 1208416638, "9": 1208791584, "10": 1208478700, "11": 1205560642, "12": 1207294660, "13": 1207627278, "14": 1208577656, "15": 1204816470, "16": 1205356152, "17": 1205970194, "18":... | {"0": 1037919454, "1": 1079725504, "2": 1079329966, "3": 1079138346, "4": 1079806728, "5": 1079251888, "6": 1081075138, "7": 1081318238, "8": 1080226290, "9": 1081014220, "10": 1080183104, "11": 1079693472, "12": 1079133198, "13": 1079342264, "14": 1081384590, "15": 1080016366, "16": 1079726934, "17": 1080831466, "18":... | [] | [] | ok | ok | 125,415,333,758 | 112,172,100,326 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.118062 | 1.118062 | 6.280816 | false | false | false | 0.124862 | 0.111843 | 1.116402 | 0.020439 | Accepted | Accepted | 0.020439 | 0.124674 | 0.182747 | 1 | 3 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 6.031856 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s176788640 | s500226443 | train | cpp | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using namespace std;
struct P {
ll taste;
int a;
int b;
int c;
bool operator<(const P &another) const {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using namespace std;
vector<ll> AB;
vector<ll> ans;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(... | {"0": 1163914180, "1": 1213125914, "2": 1213326686, "3": 1214120622, "4": 1213806594, "5": 1214110326, "6": 1216510438, "7": 1217639280, "8": 1216158086, "9": 1216354282, "10": 1216268768, "11": 1212617692, "12": 1215062706, "13": 1215028958, "14": 1216577076, "15": 1211677038, "16": 1213271774, "17": 1214140642, "18":... | {"0": 1037636028, "1": 1080263756, "2": 1080256034, "3": 1079065416, "4": 1079471822, "5": 1079942292, "6": 1081390596, "7": 1081182102, "8": 1081385734, "9": 1081046538, "10": 1081549898, "11": 1080455376, "12": 1079035672, "13": 1079810446, "14": 1081391168, "15": 1080246310, "16": 1079729794, "17": 1079357136, "18":... | [] | [] | ok | ok | 126,188,168,392 | 112,199,755,096 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.124674 | 1.124674 | 6.31952 | false | false | false | 0.125707 | 0.111777 | 1.124617 | 0.020439 | Accepted | Accepted | 0.020439 | 0.132323 | 0.182855 | 1 | 3 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 6.069025 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s231332085 | s500226443 | train | cpp | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using namespace std;
struct P {
ll taste;
int a;
int b;
int c;
bool operator<(const P &d) const {
if (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using namespace std;
vector<ll> AB;
vector<ll> ans;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(... | {"0": 1162009706, "1": 1205956466, "2": 1205711364, "3": 1207738818, "4": 1206027966, "5": 1206095176, "6": 1208791584, "7": 1208791584, "8": 1208416638, "9": 1208791584, "10": 1208478700, "11": 1205560642, "12": 1207294660, "13": 1207627278, "14": 1208577656, "15": 1204816470, "16": 1205356152, "17": 1205970194, "18":... | {"0": 1037636028, "1": 1080263756, "2": 1080256034, "3": 1079065416, "4": 1079471822, "5": 1079942292, "6": 1081390596, "7": 1081182102, "8": 1081385734, "9": 1081046538, "10": 1081549898, "11": 1080455376, "12": 1079035672, "13": 1079810446, "14": 1081391168, "15": 1080246310, "16": 1079729794, "17": 1079357136, "18":... | [] | [] | ok | ok | 125,415,333,758 | 112,199,755,096 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.117786 | 1.117786 | 6.280816 | false | false | false | 0.124862 | 0.111777 | 1.117061 | 0.020439 | Accepted | Accepted | 0.020439 | 0.125306 | 0.182855 | 1 | 3 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 6.031856 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s176788640 | s625315212 | train | cpp | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using namespace std;
struct P {
ll taste;
int a;
int b;
int c;
bool operator<(const P &another) const {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using namespace std;
vector<ll> ans;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<... | {"0": 1163914180, "1": 1213125914, "2": 1213326686, "3": 1214120622, "4": 1213806594, "5": 1214110326, "6": 1216510438, "7": 1217639280, "8": 1216158086, "9": 1216354282, "10": 1216268768, "11": 1212617692, "12": 1215062706, "13": 1215028958, "14": 1216577076, "15": 1211677038, "16": 1213271774, "17": 1214140642, "18":... | {"0": 1037714392, "1": 1090059828, "2": 1089587642, "3": 1090586068, "4": 1090004630, "5": 1089547602, "6": 1090059256, "7": 1091507274, "8": 1091562186, "9": 1091570766, "10": 1091367420, "11": 1089527868, "12": 1090048388, "13": 1089500126, "14": 1091092860, "15": 1089483252, "16": 1091498694, "17": 1089497838, "18":... | [] | [] | ok | ok | 126,188,168,392 | 113,153,160,406 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.115198 | 1.115198 | 6.31952 | false | false | false | 0.125707 | 0.112663 | 1.115771 | 0.020439 | Accepted | Accepted | 0.020439 | 0.123905 | 0.181416 | 1 | 2 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 6.069025 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03078 | s231332085 | s625315212 | train | cpp | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using namespace std;
struct P {
ll taste;
int a;
int b;
int c;
bool operator<(const P &d) const {
if (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using namespace std;
vector<ll> ans;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<... | {"0": 1162009706, "1": 1205956466, "2": 1205711364, "3": 1207738818, "4": 1206027966, "5": 1206095176, "6": 1208791584, "7": 1208791584, "8": 1208416638, "9": 1208791584, "10": 1208478700, "11": 1205560642, "12": 1207294660, "13": 1207627278, "14": 1208577656, "15": 1204816470, "16": 1205356152, "17": 1205970194, "18":... | {"0": 1037714392, "1": 1090059828, "2": 1089587642, "3": 1090586068, "4": 1090004630, "5": 1089547602, "6": 1090059256, "7": 1091507274, "8": 1091562186, "9": 1091570766, "10": 1091367420, "11": 1089527868, "12": 1090048388, "13": 1089500126, "14": 1091092860, "15": 1089483252, "16": 1091498694, "17": 1089497838, "18":... | [] | [] | ok | ok | 125,415,333,758 | 113,153,160,406 | [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, 8... | [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, 8... | [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, 8... | 104 | 104 | 104 | 104 | 0 | 0 | 0 | 1.108368 | 1.108368 | 6.280816 | false | false | false | 0.124862 | 0.112663 | 1.108275 | 0.020439 | Accepted | Accepted | 0.020439 | 0.11682 | 0.181416 | 1 | 2 | s669931122 | {"0": 190006388, "1": 200197998, "2": 200348434, "3": 199348578, "4": 199865952, "5": 200044702, "6": 200492578, "7": 200869526, "8": 200347576, "9": 200872672, "10": 200671900, "11": 200215444, "12": 199235894, "13": 199348578, "14": 200686486, "15": 200350150, "16": 200804604, "17": 199360018, "18": 200490290, "19": ... | [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, 8... | 20,792,164,536 | 6.031856 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s146893245 | s161118872 | train | cpp | #include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
const int MAXN = 100000;
int n, m;
int fa[MAXN+5];
int val[MAXN+5];
vector <int> blk[MAXN+5];
vector <int> ansEdge;
long long int ans;
int SetFind(int x)
{
if(fa... | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
struct Heap{
Heap *l, *r;
int val, len, size;
}*root[N], Pool[N * 2], *cur = Pool;
int fa[N];
priority_queue<pair<int, int> >Q;
Heap *newnode(int val_)
{
cur++;
cur -> len = 0;
cur -> size = 1;
cur -> val = val_;
cur -> ... | {"0": 3626660180, "1": 3620983938, "2": 3621575958, "3": 3626878684, "4": 3626374466, "5": 3623092044, "6": 3623092044, "7": 3621930312, "8": 3621813338, "9": 3622987368, "10": 3621698366, "11": 3621930312, "12": 3621993804, "13": 3621993804, "14": 3621993804, "15": 3621930598, "16": 3621993804, "17": 3621930598, "18":... | {"0": 1029503618, "1": 1021131826, "2": 1024844106, "3": 1029235350, "4": 1029417818, "5": 1026388220, "6": 1026388220, "7": 1025726130, "8": 1025720124, "9": 1026311572, "10": 1025769888, "11": 1025726130, "12": 1026348180, "13": 1026348180, "14": 1026348180, "15": 1025704966, "16": 1026348180, "17": 1025704966, "18":... | [] | [] | ok | ok | 376,696,235,058 | 106,511,619,214 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 3.536732 | 3.536668 | 18.864996 | false | false | false | 0.206108 | 0.057834 | 3.563798 | 0.010832 | Accepted | Accepted | 0.010832 | 0.759304 | 0.187287 | 4 | 4 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.687187 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s146893245 | s524578974 | train | cpp | #include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
const int MAXN = 100000;
int n, m;
int fa[MAXN+5];
int val[MAXN+5];
vector <int> blk[MAXN+5];
vector <int> ansEdge;
long long int ans;
int SetFind(int x)
{
if(fa... | #include <stdio.h>
#include <string.h>
#include <algorithm>
#define N 100010
int n,m,c[N],d[N],k[N];char vis[N];
int fa[N];
int find(int x) {
return ~fa[x]?fa[x]=find(fa[x]):x;
}
inline void join(int a,int b) {
int x=find(a),y=find(b);
if(x!=y) {
fa[x]=y;
if(d[k[y]]>d[k[x]]) k[y]=k[x];
}
}
int m... | {"0": 3626660180, "1": 3620983938, "2": 3621575958, "3": 3626878684, "4": 3626374466, "5": 3623092044, "6": 3623092044, "7": 3621930312, "8": 3621813338, "9": 3622987368, "10": 3621698366, "11": 3621930312, "12": 3621993804, "13": 3621993804, "14": 3621993804, "15": 3621930598, "16": 3621993804, "17": 3621930598, "18":... | {"0": 607863828, "1": 191986080, "2": 191875398, "3": 607863828, "4": 607968218, "5": 604843668, "6": 604843668, "7": 604779318, "8": 604738706, "9": 604997822, "10": 604779318, "11": 604779318, "12": 604914024, "13": 604914024, "14": 604914024, "15": 604852534, "16": 604914024, "17": 604852534, "18": 604997822, "19": ... | [] | [] | ok | ok | 376,696,235,058 | 36,083,408,218 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 10.515504 | 10.439597 | 18.864996 | false | false | false | 0.206108 | 0.012487 | 16.505451 | 0.010832 | Accepted | Accepted | 0.010832 | 0.991521 | 0.867404 | 7 | 6 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.687187 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s161118872 | s524578974 | train | cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
struct Heap{
Heap *l, *r;
int val, len, size;
}*root[N], Pool[N * 2], *cur = Pool;
int fa[N];
priority_queue<pair<int, int> >Q;
Heap *newnode(int val_)
{
cur++;
cur -> len = 0;
cur -> size = 1;
cur -> val = val_;
cur -> ... | #include <stdio.h>
#include <string.h>
#include <algorithm>
#define N 100010
int n,m,c[N],d[N],k[N];char vis[N];
int fa[N];
int find(int x) {
return ~fa[x]?fa[x]=find(fa[x]):x;
}
inline void join(int a,int b) {
int x=find(a),y=find(b);
if(x!=y) {
fa[x]=y;
if(d[k[y]]>d[k[x]]) k[y]=k[x];
}
}
int m... | {"0": 1029503618, "1": 1021131826, "2": 1024844106, "3": 1029235350, "4": 1029417818, "5": 1026388220, "6": 1026388220, "7": 1025726130, "8": 1025720124, "9": 1026311572, "10": 1025769888, "11": 1025726130, "12": 1026348180, "13": 1026348180, "14": 1026348180, "15": 1025704966, "16": 1026348180, "17": 1025704966, "18":... | {"0": 607863828, "1": 191986080, "2": 191875398, "3": 607863828, "4": 607968218, "5": 604843668, "6": 604843668, "7": 604779318, "8": 604738706, "9": 604997822, "10": 604779318, "11": 604779318, "12": 604914024, "13": 604914024, "14": 604914024, "15": 604852534, "16": 604914024, "17": 604852534, "18": 604997822, "19": ... | [] | [] | ok | ok | 106,511,619,214 | 36,083,408,218 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 2.973226 | 2.951817 | 5.334116 | false | false | false | 0.057834 | 0.012487 | 4.631421 | 0.010832 | Accepted | Accepted | 0.010832 | 0.964773 | 0.867404 | 6 | 6 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 5.283744 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s146893245 | s795701420 | train | cpp | #include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
const int MAXN = 100000;
int n, m;
int fa[MAXN+5];
int val[MAXN+5];
vector <int> blk[MAXN+5];
vector <int> ansEdge;
long long int ans;
int SetFind(int x)
{
if(fa... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#define MN 200000
#define MM 200000
#define INF 0x7fffffff
int n,m,a[MN+5];
int hd[MN+5],nxt[MM+5],to[MM+5],rn=0;
int mi1,mi2,lc=0,l[MN+5],lft=2,cnt=0;
long long ans=0;
bool usd[MN+5],usd2[MN+5];
inline void add(int u,int v){
... | {"0": 3626660180, "1": 3620983938, "2": 3621575958, "3": 3626878684, "4": 3626374466, "5": 3623092044, "6": 3623092044, "7": 3621930312, "8": 3621813338, "9": 3622987368, "10": 3621698366, "11": 3621930312, "12": 3621993804, "13": 3621993804, "14": 3621993804, "15": 3621930598, "16": 3621993804, "17": 3621930598, "18":... | {"0": 1437101952, "1": 1432200198, "2": 1431368224, "3": 1437077928, "4": 1437165158, "5": 1434631770, "6": 1434631770, "7": 1434640636, "8": 1434547972, "9": 1434761042, "10": 1434547972, "11": 1434640636, "12": 1434631770, "13": 1434631770, "14": 1434631770, "15": 1434631770, "16": 1434631770, "17": 1434631770, "18":... | [] | [] | ok | ok | 376,696,235,058 | 149,033,148,264 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 2.527626 | 2.5276 | 18.864996 | false | false | false | 0.206108 | 0.08113 | 2.540463 | 0.010832 | Accepted | Accepted | 0.010832 | 0.640005 | 0.133508 | 4 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.687187 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s146893245 | s287533378 | train | cpp | #include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
const int MAXN = 100000;
int n, m;
int fa[MAXN+5];
int val[MAXN+5];
vector <int> blk[MAXN+5];
vector <int> ansEdge;
long long int ans;
int SetFind(int x)
{
if(fa... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 100005;
int a[maxn], fa[maxn], mi[maxn], id[maxn], vis[maxn];
int n, m;
void Init()
{
for(int i = 0; i <= n; i++)
{
fa[i] = i;
mi[i] = a[i];
id[i] = i;
}
}
int Find(int x)
{
... | {"0": 3626660180, "1": 3620983938, "2": 3621575958, "3": 3626878684, "4": 3626374466, "5": 3623092044, "6": 3623092044, "7": 3621930312, "8": 3621813338, "9": 3622987368, "10": 3621698366, "11": 3621930312, "12": 3621993804, "13": 3621993804, "14": 3621993804, "15": 3621930598, "16": 3621993804, "17": 3621930598, "18":... | {"0": 1025938628, "1": 1021105228, "2": 1019204758, "3": 1025974092, "4": 1026378210, "5": 1022300422, "6": 1022300422, "7": 1022311290, "8": 1022270964, "9": 1022277256, "10": 1022270964, "11": 1022311290, "12": 1022418254, "13": 1022418254, "14": 1022418254, "15": 1022333312, "16": 1022418254, "17": 1022333312, "18":... | [] | [] | ok | ok | 376,696,235,058 | 106,218,672,846 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 3.546446 | 3.546422 | 18.864996 | false | false | false | 0.206108 | 0.058013 | 3.552777 | 0.010832 | Accepted | Accepted | 0.010832 | 0.758385 | 0.186708 | 4 | 4 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.687187 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s795701420 | s287533378 | train | cpp | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#define MN 200000
#define MM 200000
#define INF 0x7fffffff
int n,m,a[MN+5];
int hd[MN+5],nxt[MM+5],to[MM+5],rn=0;
int mi1,mi2,lc=0,l[MN+5],lft=2,cnt=0;
long long ans=0;
bool usd[MN+5],usd2[MN+5];
inline void add(int u,int v){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 100005;
int a[maxn], fa[maxn], mi[maxn], id[maxn], vis[maxn];
int n, m;
void Init()
{
for(int i = 0; i <= n; i++)
{
fa[i] = i;
mi[i] = a[i];
id[i] = i;
}
}
int Find(int x)
{
... | {"0": 1437101952, "1": 1432200198, "2": 1431368224, "3": 1437077928, "4": 1437165158, "5": 1434631770, "6": 1434631770, "7": 1434640636, "8": 1434547972, "9": 1434761042, "10": 1434547972, "11": 1434640636, "12": 1434631770, "13": 1434631770, "14": 1434631770, "15": 1434631770, "16": 1434631770, "17": 1434631770, "18":... | {"0": 1025938628, "1": 1021105228, "2": 1019204758, "3": 1025974092, "4": 1026378210, "5": 1022300422, "6": 1022300422, "7": 1022311290, "8": 1022270964, "9": 1022277256, "10": 1022270964, "11": 1022311290, "12": 1022418254, "13": 1022418254, "14": 1022418254, "15": 1022333312, "16": 1022418254, "17": 1022333312, "18":... | [] | [] | ok | ok | 149,033,148,264 | 106,218,672,846 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 1.403074 | 1.403079 | 7.463599 | false | false | false | 0.08113 | 0.058013 | 1.398476 | 0.010832 | Accepted | Accepted | 0.010832 | 0.328839 | 0.186708 | 2 | 4 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 7.393179 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s059474458 | s287533378 | train | cpp | #include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
return x*f;
}
#define MN 100005
int n,m,fa[MN],vis[MN],cnt,p[MN],ct;
long long a[MN],ans;
int f... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 100005;
int a[maxn], fa[maxn], mi[maxn], id[maxn], vis[maxn];
int n, m;
void Init()
{
for(int i = 0; i <= n; i++)
{
fa[i] = i;
mi[i] = a[i];
id[i] = i;
}
}
int Find(int x)
{
... | {"0": 3603979236, "1": 3595022574, "2": 3594872138, "3": 3603857686, "4": 3603779036, "5": 3602334450, "6": 3602334450, "7": 3602473160, "8": 3602473160, "9": 3602401660, "10": 3602405950, "11": 3602473160, "12": 3602351610, "13": 3602351610, "14": 3602351610, "15": 3602351610, "16": 3602351610, "17": 3602351610, "18":... | {"0": 1025938628, "1": 1021105228, "2": 1019204758, "3": 1025974092, "4": 1026378210, "5": 1022300422, "6": 1022300422, "7": 1022311290, "8": 1022270964, "9": 1022277256, "10": 1022270964, "11": 1022311290, "12": 1022418254, "13": 1022418254, "14": 1022418254, "15": 1022333312, "16": 1022418254, "17": 1022333312, "18":... | [] | [] | ok | ok | 374,176,313,368 | 106,218,672,846 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 3.522687 | 3.522698 | 18.738798 | false | false | false | 0.204415 | 0.058013 | 3.523581 | 0.010832 | Accepted | Accepted | 0.010832 | 0.756271 | 0.186708 | 4 | 4 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.56199 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s146893245 | s372033583 | train | cpp | #include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
const int MAXN = 100000;
int n, m;
int fa[MAXN+5];
int val[MAXN+5];
vector <int> blk[MAXN+5];
vector <int> ansEdge;
long long int ans;
int SetFind(int x)
{
if(fa... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 100010;
int a[maxn], fa[maxn], mi[maxn], id[maxn], vis[maxn];
int n, m;
void Init()
{
for(int i = 0; i <= n; i++)
{
fa[i] = i;
mi[i] = a[i];
id[i] = i;
}
}
int Find(int x)
{
... | {"0": 3626660180, "1": 3620983938, "2": 3621575958, "3": 3626878684, "4": 3626374466, "5": 3623092044, "6": 3623092044, "7": 3621930312, "8": 3621813338, "9": 3622987368, "10": 3621698366, "11": 3621930312, "12": 3621993804, "13": 3621993804, "14": 3621993804, "15": 3621930598, "16": 3621993804, "17": 3621930598, "18":... | {"0": 1025988392, "1": 1021105228, "2": 1019235646, "3": 1025974092, "4": 1026380498, "5": 1022300422, "6": 1022300422, "7": 1022311290, "8": 1022270964, "9": 1022277256, "10": 1022270964, "11": 1022311290, "12": 1022418254, "13": 1022418254, "14": 1022418254, "15": 1022333312, "16": 1022418254, "17": 1022333312, "18":... | [] | [] | ok | ok | 376,696,235,058 | 106,219,246,276 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 3.546427 | 3.546403 | 18.864996 | false | false | false | 0.206108 | 0.058013 | 3.552777 | 0.010832 | Accepted | Accepted | 0.010832 | 0.758385 | 0.186708 | 4 | 4 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.687187 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s795701420 | s372033583 | train | cpp | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#define MN 200000
#define MM 200000
#define INF 0x7fffffff
int n,m,a[MN+5];
int hd[MN+5],nxt[MM+5],to[MM+5],rn=0;
int mi1,mi2,lc=0,l[MN+5],lft=2,cnt=0;
long long ans=0;
bool usd[MN+5],usd2[MN+5];
inline void add(int u,int v){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 100010;
int a[maxn], fa[maxn], mi[maxn], id[maxn], vis[maxn];
int n, m;
void Init()
{
for(int i = 0; i <= n; i++)
{
fa[i] = i;
mi[i] = a[i];
id[i] = i;
}
}
int Find(int x)
{
... | {"0": 1437101952, "1": 1432200198, "2": 1431368224, "3": 1437077928, "4": 1437165158, "5": 1434631770, "6": 1434631770, "7": 1434640636, "8": 1434547972, "9": 1434761042, "10": 1434547972, "11": 1434640636, "12": 1434631770, "13": 1434631770, "14": 1434631770, "15": 1434631770, "16": 1434631770, "17": 1434631770, "18":... | {"0": 1025988392, "1": 1021105228, "2": 1019235646, "3": 1025974092, "4": 1026380498, "5": 1022300422, "6": 1022300422, "7": 1022311290, "8": 1022270964, "9": 1022277256, "10": 1022270964, "11": 1022311290, "12": 1022418254, "13": 1022418254, "14": 1022418254, "15": 1022333312, "16": 1022418254, "17": 1022333312, "18":... | [] | [] | ok | ok | 149,033,148,264 | 106,219,246,276 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 1.403067 | 1.403071 | 7.463599 | false | false | false | 0.08113 | 0.058013 | 1.398476 | 0.010832 | Accepted | Accepted | 0.010832 | 0.328839 | 0.186708 | 2 | 4 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 7.393179 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s059474458 | s372033583 | train | cpp | #include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
return x*f;
}
#define MN 100005
int n,m,fa[MN],vis[MN],cnt,p[MN],ct;
long long a[MN],ans;
int f... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 100010;
int a[maxn], fa[maxn], mi[maxn], id[maxn], vis[maxn];
int n, m;
void Init()
{
for(int i = 0; i <= n; i++)
{
fa[i] = i;
mi[i] = a[i];
id[i] = i;
}
}
int Find(int x)
{
... | {"0": 3603979236, "1": 3595022574, "2": 3594872138, "3": 3603857686, "4": 3603779036, "5": 3602334450, "6": 3602334450, "7": 3602473160, "8": 3602473160, "9": 3602401660, "10": 3602405950, "11": 3602473160, "12": 3602351610, "13": 3602351610, "14": 3602351610, "15": 3602351610, "16": 3602351610, "17": 3602351610, "18":... | {"0": 1025988392, "1": 1021105228, "2": 1019235646, "3": 1025974092, "4": 1026380498, "5": 1022300422, "6": 1022300422, "7": 1022311290, "8": 1022270964, "9": 1022277256, "10": 1022270964, "11": 1022311290, "12": 1022418254, "13": 1022418254, "14": 1022418254, "15": 1022333312, "16": 1022418254, "17": 1022333312, "18":... | [] | [] | ok | ok | 374,176,313,368 | 106,219,246,276 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 3.522667 | 3.522679 | 18.738798 | false | false | false | 0.204415 | 0.058013 | 3.523581 | 0.010832 | Accepted | Accepted | 0.010832 | 0.756271 | 0.186708 | 4 | 4 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.56199 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s791089970 | s281228417 | train | cpp | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i=k; i<(ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
const ll MOD = 10007;
const ll HIGH... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#inc... | {"0": 5567877744, "1": 5558200934, "2": 5560907066, "3": 5568779216, "4": 5567934658, "5": 5562920792, "6": 5562920792, "7": 5560993438, "8": 5561345504, "9": 5562692564, "10": 5561993580, "11": 5560993438, "12": 5561345218, "13": 5561345218, "14": 5561345218, "15": 5561345218, "16": 5561345218, "17": 5561345218, "18":... | {"0": 1055967770, "1": 1044243200, "2": 1047200440, "3": 1056908710, "4": 1055949466, "5": 1049941178, "6": 1049941178, "7": 1049563658, "8": 1049463844, "9": 1049581676, "10": 1049463844, "11": 1049563658, "12": 1049569378, "13": 1049569378, "14": 1049569378, "15": 1049471280, "16": 1049569378, "17": 1049471280, "18":... | [] | [] | ok | ok | 578,382,465,518 | 108,956,640,650 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 5.308472 | 5.308373 | 28.965468 | false | false | false | 0.316479 | 0.059287 | 5.338075 | 0.010832 | Accepted | Accepted | 0.010832 | 0.841466 | 0.182696 | 5 | 3 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 28.692441 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s222562231 | s641323479 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
int n, m, k;
int w[maxn], f[maxn];
ll ans;
priority_queue <int, vector<int>, greater<int>> q[maxn];
multiset <int> s;
int find(int x)
{
return f[x] == x ? x : f[x] = find(f[x]);
}
void merge(int x, int ... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 101010;
int a[MAXN];
class Node {
public:
int v;
Node *l, *r;
int key;
Node(int x) {
v = a[x];
l = r = 0;
key = 1;
}
};
//set<pair<int,int> > s;
class Road {
public:
int t, next;
}e[MAXN * 2];
int p[MAXN];
int z... | {"0": 4437096092, "1": 4420166608, "2": 4420478348, "3": 4437504214, "4": 4436726008, "5": 4429558848, "6": 4429558848, "7": 4429558276, "8": 4429316320, "9": 4429738742, "10": 4429463038, "11": 4429558276, "12": 4429972976, "13": 4429972976, "14": 4429972976, "15": 4429561136, "16": 4429972976, "17": 4429561136, "18":... | {"0": 1851958108, "1": 1846186342, "2": 1844291020, "3": 1851969262, "4": 1852056492, "5": 1848283008, "6": 1848283008, "7": 1848323334, "8": 1848318758, "9": 1848258984, "10": 1848328768, "11": 1848323334, "12": 1848375958, "13": 1848375958, "14": 1848375958, "15": 1848303886, "16": 1848375958, "17": 1848303886, "18":... | [] | [] | ok | ok | 460,118,177,090 | 192,056,984,262 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 2.395728 | 2.395738 | 23.042777 | false | false | false | 0.251814 | 0.10457 | 2.408101 | 0.010832 | Accepted | Accepted | 0.010832 | 0.611017 | 0.103582 | 4 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 22.825362 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s222562231 | s434800533 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
int n, m, k;
int w[maxn], f[maxn];
ll ans;
priority_queue <int, vector<int>, greater<int>> q[maxn];
multiset <int> s;
int find(int x)
{
return f[x] == x ? x : f[x] = find(f[x]);
}
void merge(int x, int ... | #include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 100005
#define LL long long
using namespace std;
int n,m,fa[maxn],use[maxn],cnt;
LL ans;
struct node { int w;bool vis; } a[maxn];
bool cmp(node p,node q)
{
if(p.vis) return false;
if(q.vis) return true;
return p.w<q.w;
}
int find(in... | {"0": 4437096092, "1": 4420166608, "2": 4420478348, "3": 4437504214, "4": 4436726008, "5": 4429558848, "6": 4429558848, "7": 4429558276, "8": 4429316320, "9": 4429738742, "10": 4429463038, "11": 4429558276, "12": 4429972976, "13": 4429972976, "14": 4429972976, "15": 4429561136, "16": 4429972976, "17": 4429561136, "18":... | {"0": 198710512, "1": 194387908, "2": 192854376, "3": 198710512, "4": 198803176, "5": 196572376, "6": 196572376, "7": 196482572, "8": 196415648, "9": 196482572, "10": 196482572, "11": 196482572, "12": 196572376, "13": 196572376, "14": 196572376, "15": 196572376, "16": 196572376, "17": 196572376, "18": 196482572, "19": ... | [] | [] | ok | ok | 460,118,177,090 | 20,271,223,258 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 22.699592 | 22.698096 | 23.042777 | false | false | false | 0.251814 | 0.010867 | 23.172197 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999852 | 0.996727 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 22.825362 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s641323479 | s434800533 | train | cpp | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 101010;
int a[MAXN];
class Node {
public:
int v;
Node *l, *r;
int key;
Node(int x) {
v = a[x];
l = r = 0;
key = 1;
}
};
//set<pair<int,int> > s;
class Road {
public:
int t, next;
}e[MAXN * 2];
int p[MAXN];
int z... | #include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 100005
#define LL long long
using namespace std;
int n,m,fa[maxn],use[maxn],cnt;
LL ans;
struct node { int w;bool vis; } a[maxn];
bool cmp(node p,node q)
{
if(p.vis) return false;
if(q.vis) return true;
return p.w<q.w;
}
int find(in... | {"0": 1851958108, "1": 1846186342, "2": 1844291020, "3": 1851969262, "4": 1852056492, "5": 1848283008, "6": 1848283008, "7": 1848323334, "8": 1848318758, "9": 1848258984, "10": 1848328768, "11": 1848323334, "12": 1848375958, "13": 1848375958, "14": 1848375958, "15": 1848303886, "16": 1848375958, "17": 1848303886, "18":... | {"0": 198710512, "1": 194387908, "2": 192854376, "3": 198710512, "4": 198803176, "5": 196572376, "6": 196572376, "7": 196482572, "8": 196415648, "9": 196482572, "10": 196482572, "11": 196482572, "12": 196572376, "13": 196572376, "14": 196572376, "15": 196572376, "16": 196572376, "17": 196572376, "18": 196482572, "19": ... | [] | [] | ok | ok | 192,056,984,262 | 20,271,223,258 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 9.475028 | 9.474366 | 9.618238 | false | false | false | 0.10457 | 0.010867 | 9.622602 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999621 | 0.996727 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 9.527525 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s222562231 | s352748384 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
int n, m, k;
int w[maxn], f[maxn];
ll ans;
priority_queue <int, vector<int>, greater<int>> q[maxn];
multiset <int> s;
int find(int x)
{
return f[x] == x ? x : f[x] = find(f[x]);
}
void merge(int x, int ... | #include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int t[101000];
int val[101000],b[101000],c[101000],k2=0;
int h[101000],nxt[201000],K=0,to[201000];
void ins(int u,int v){nxt[++K]=h[u];h[u]=K;to[K]=v;}
int Min;
void dfs(int x,int o)
{
t[x]=o;Min=min(Min,val[x]);c[++k2]=x;
for(in... | {"0": 4437096092, "1": 4420166608, "2": 4420478348, "3": 4437504214, "4": 4436726008, "5": 4429558848, "6": 4429558848, "7": 4429558276, "8": 4429316320, "9": 4429738742, "10": 4429463038, "11": 4429558276, "12": 4429972976, "13": 4429972976, "14": 4429972976, "15": 4429561136, "16": 4429972976, "17": 4429561136, "18":... | {"0": 1021972952, "1": 1017042026, "2": 1016212340, "3": 1021981532, "4": 1022065902, "5": 1019051176, "6": 1019051176, "7": 1019036304, "8": 1019048888, "9": 1019293418, "10": 1019043454, "11": 1019036304, "12": 1019082350, "13": 1019082350, "14": 1019082350, "15": 1019051748, "16": 1019082350, "17": 1019051748, "18":... | [] | [] | ok | ok | 460,118,177,090 | 105,844,969,516 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 4.34711 | 4.347095 | 23.042777 | false | false | false | 0.251814 | 0.057323 | 4.392874 | 0.010832 | Accepted | Accepted | 0.010832 | 0.807074 | 0.188955 | 5 | 5 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 22.825362 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s641323479 | s352748384 | train | cpp | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 101010;
int a[MAXN];
class Node {
public:
int v;
Node *l, *r;
int key;
Node(int x) {
v = a[x];
l = r = 0;
key = 1;
}
};
//set<pair<int,int> > s;
class Road {
public:
int t, next;
}e[MAXN * 2];
int p[MAXN];
int z... | #include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int t[101000];
int val[101000],b[101000],c[101000],k2=0;
int h[101000],nxt[201000],K=0,to[201000];
void ins(int u,int v){nxt[++K]=h[u];h[u]=K;to[K]=v;}
int Min;
void dfs(int x,int o)
{
t[x]=o;Min=min(Min,val[x]);c[++k2]=x;
for(in... | {"0": 1851958108, "1": 1846186342, "2": 1844291020, "3": 1851969262, "4": 1852056492, "5": 1848283008, "6": 1848283008, "7": 1848323334, "8": 1848318758, "9": 1848258984, "10": 1848328768, "11": 1848323334, "12": 1848375958, "13": 1848375958, "14": 1848375958, "15": 1848303886, "16": 1848375958, "17": 1848303886, "18":... | {"0": 1021972952, "1": 1017042026, "2": 1016212340, "3": 1021981532, "4": 1022065902, "5": 1019051176, "6": 1019051176, "7": 1019036304, "8": 1019048888, "9": 1019293418, "10": 1019043454, "11": 1019036304, "12": 1019082350, "13": 1019082350, "14": 1019082350, "15": 1019051748, "16": 1019082350, "17": 1019051748, "18":... | [] | [] | ok | ok | 192,056,984,262 | 105,844,969,516 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 1.814525 | 1.814512 | 9.618238 | false | false | false | 0.10457 | 0.057323 | 1.824207 | 0.010832 | Accepted | Accepted | 0.010832 | 0.504024 | 0.188955 | 3 | 5 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 9.527525 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s222562231 | s998293729 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
int n, m, k;
int w[maxn], f[maxn];
ll ans;
priority_queue <int, vector<int>, greater<int>> q[maxn];
multiset <int> s;
int find(int x)
{
return f[x] == x ? x : f[x] = find(f[x]);
}
void merge(int x, int ... | #include<algorithm>
#include<cstdio>
#include<cstring>
#include<vector>
const int Maxv = 100020, INF = 0x7fffffff;
std::vector<int> g[Maxv];
int v[Maxv], fa[Maxv], idx[Maxv], cnt, n, m;
long long ans;
bool vis[Maxv];
inline int read(){
int x = 0, f = 1;
char ch = getchar();
while (ch ... | {"0": 4437096092, "1": 4420166608, "2": 4420478348, "3": 4437504214, "4": 4436726008, "5": 4429558848, "6": 4429558848, "7": 4429558276, "8": 4429316320, "9": 4429738742, "10": 4429463038, "11": 4429558276, "12": 4429972976, "13": 4429972976, "14": 4429972976, "15": 4429561136, "16": 4429972976, "17": 4429561136, "18":... | {"0": 3528127174, "1": 3519689030, "2": 3519934990, "3": 3528214118, "4": 3527568044, "5": 3526625388, "6": 3526625388, "7": 3526560466, "8": 3526560466, "9": 3526602508, "10": 3526655704, "11": 3526560466, "12": 3526662568, "13": 3526662568, "14": 3526662568, "15": 3526662568, "16": 3526662568, "17": 3526662568, "18":... | [] | [] | ok | ok | 460,118,177,090 | 366,339,203,516 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 1.255989 | 1.255989 | 23.042777 | false | false | false | 0.251814 | 0.200281 | 1.257307 | 0.010832 | Accepted | Accepted | 0.010832 | 0.213848 | 0.054082 | 1 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 22.825362 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s930344679 | s299005074 | train | cpp | #include <iostream>
#include <cassert>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
using namespace std;
int N,M;
int T[100005];
int A[100005];
long long rez;
multiset<int> G[100005];
int fi(int nod){
if(T[nod] <= 0){
return nod;
}
return T[nod] = fi(T[nod])... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int NMAX = 1e5;
int n,m;
vector<int> graph[NMAX + 5];
int val[NMAX + 5];
bool viz[NMAX + 5];
int dfs(int nod){
viz[nod] = 1;
int ans = nod;
for(auto it:graph[nod]){
if(!viz[it]){
int tmp = dfs(it);
if(v... | {"0": 6500886678, "1": 6494876960, "2": 6490398772, "3": 6500139074, "4": 6499476412, "5": 6491424654, "6": 6491424654, "7": 6495841638, "8": 6492679622, "9": 6492706220, "10": 6492681624, "11": 6495841638, "12": 6495571654, "13": 6495571654, "14": 6495571654, "15": 6495577660, "16": 6495571654, "17": 6495577660, "18":... | {"0": 3534465792, "1": 3524086852, "2": 3522976028, "3": 3534502400, "4": 3534519846, "5": 3526399448, "6": 3526399448, "7": 3526411746, "8": 3526097718, "9": 3526625102, "10": 3526098004, "11": 3526411746, "12": 3526253874, "13": 3526253874, "14": 3526253874, "15": 3526301922, "16": 3526253874, "17": 3526301922, "18":... | [] | [] | ok | ok | 675,268,453,860 | 366,605,165,212 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 1.841947 | 1.84195 | 33.817531 | false | false | false | 0.369361 | 0.200537 | 1.841862 | 0.010832 | Accepted | Accepted | 0.010832 | 0.47088 | 0.054013 | 3 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 33.498664 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s943257023 | s810598254 | train | cpp | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <num... | # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char c... | {"0": 3626231466, "1": 3616767154, "2": 3618144816, "3": 3626090468, "4": 3625960052, "5": 3618110210, "6": 3618110210, "7": 3617024268, "8": 3617024268, "9": 3618569240, "10": 3617138954, "11": 3617024268, "12": 3617176420, "13": 3617176420, "14": 3617176420, "15": 3617044860, "16": 3617176420, "17": 3617044860, "18":... | {"0": 3695992872, "1": 3693979718, "2": 1102291190, "3": 3696943250, "4": 3697323058, "5": 3693526694, "6": 3693526694, "7": 3693035918, "8": 3692617500, "9": 3694784522, "10": 3694017184, "11": 3693035918, "12": 3694405286, "13": 3694405286, "14": 3694405286, "15": 3694017184, "16": 3694405286, "17": 3694017184, "18":... | [] | [] | ok | ok | 376,289,250,480 | 309,024,472,328 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 1.220553 | 1.217668 | 18.844614 | false | false | false | 0.205759 | 0.135002 | 1.524114 | 0.010832 | Accepted | Accepted | 0.010832 | 0.36299 | 0.080232 | 2 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.667021 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s470796503 | s810598254 | train | cpp | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <num... | # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char c... | {"0": 3659276478, "1": 3653197834, "2": 3649564776, "3": 3659372574, "4": 3659771830, "5": 3654493986, "6": 3654493986, "7": 3653632268, "8": 3653600522, "9": 3654523444, "10": 3653593658, "11": 3653632268, "12": 3653618540, "13": 3653618540, "14": 3653618540, "15": 3653556478, "16": 3653618540, "17": 3653556478, "18":... | {"0": 3695992872, "1": 3693979718, "2": 1102291190, "3": 3696943250, "4": 3697323058, "5": 3693526694, "6": 3693526694, "7": 3693035918, "8": 3692617500, "9": 3694784522, "10": 3694017184, "11": 3693035918, "12": 3694405286, "13": 3694405286, "14": 3694405286, "15": 3694017184, "16": 3694405286, "17": 3694017184, "18":... | [] | [] | ok | ok | 379,904,893,082 | 309,024,472,328 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 1.232277 | 1.229368 | 19.025686 | false | false | false | 0.207817 | 0.135002 | 1.539358 | 0.010832 | Accepted | Accepted | 0.010832 | 0.369645 | 0.080232 | 2 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.846322 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s609138685 | s810598254 | train | cpp | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <num... | # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char c... | {"0": 3659276478, "1": 3653191256, "2": 3649632558, "3": 3659372574, "4": 3659771830, "5": 3654517724, "6": 3654517724, "7": 3653632268, "8": 3653562198, "9": 3654505998, "10": 3653600522, "11": 3653632268, "12": 3653767832, "13": 3653767832, "14": 3653767832, "15": 3653553618, "16": 3653767832, "17": 3653553618, "18":... | {"0": 3695992872, "1": 3693979718, "2": 1102291190, "3": 3696943250, "4": 3697323058, "5": 3693526694, "6": 3693526694, "7": 3693035918, "8": 3692617500, "9": 3694784522, "10": 3694017184, "11": 3693035918, "12": 3694405286, "13": 3694405286, "14": 3694405286, "15": 3694017184, "16": 3694405286, "17": 3694017184, "18":... | [] | [] | ok | ok | 379,908,303,632 | 309,024,472,328 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 1.232288 | 1.229379 | 19.025857 | false | false | false | 0.207769 | 0.135002 | 1.539004 | 0.010832 | Accepted | Accepted | 0.010832 | 0.369491 | 0.080232 | 2 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.846493 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s421502011 | s550905759 | train | cpp | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> v[100000];
bool used[100000] = {};
const ll INF = 1145148931919810;
map<ll, ll> a;
pair<ll, ll> dfs(ll now){
used[now] = 1;
pair<ll, ll> ret = pair<ll, ll>(a[now], now);
for(ll next : v[now]){
if(used[next]) continue;
pair<... | // #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = int64_t;
using ull = uint64_t;
using PLL = pair<... | {"0": 3639376312, "1": 3627466128, "2": 3630053856, "3": 3639859080, "4": 3639341992, "5": 3631291378, "6": 3631291378, "7": 3629922010, "8": 3630016676, "9": 3631586816, "10": 3630021538, "11": 3629922010, "12": 3630016962, "13": 3630016962, "14": 3630016962, "15": 3629896556, "16": 3630016962, "17": 3629896556, "18":... | {"0": 1053666614, "1": 1046485726, "2": 1047847658, "3": 1053662610, "4": 1054065870, "5": 1049568806, "6": 1049568806, "7": 1049163544, "8": 1049138376, "9": 1049540492, "10": 1049166976, "11": 1049163544, "12": 1049162114, "13": 1049162114, "14": 1049162114, "15": 1049155250, "16": 1049162114, "17": 1049155250, "18":... | [] | [] | ok | ok | 377,523,095,664 | 109,020,277,080 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 1 | 1 | 3.46283 | 3.46287 | 18.906405 | false | false | false | 0.206326 | 0.059263 | 3.48154 | 0.010832 | Accepted | Accepted | 0.010832 | 0.752262 | 0.182771 | 4 | 3 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.728177 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s217738469 | s196530533 | train | cpp | #include <iostream>
#include <vector>
#include <algorithm>
#define llint long long
using namespace std;
llint parent[100005];
llint N, M;
llint a[100005];
vector<llint> cmp[100005];
void init(){
for(llint i = 0; i < N; i++) parent[i] = i;
}
llint root(llint i)
{
if(parent[i] == i) return i;
re... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#define llint long long
#define inf 1e18
using namespace std;
typedef pair<llint, llint> P;
struct UnionFind{
int size;
vector<int> parent;
UnionFind(){}
UnionFind(int size){
this->... | {"0": 3625928878, "1": 3619548218, "2": 3621090902, "3": 3625945180, "4": 3626047282, "5": 3622131656, "6": 3622131656, "7": 3620842654, "8": 3620429956, "9": 3622110206, "10": 3620463990, "11": 3620842654, "12": 3620410222, "13": 3620410222, "14": 3620410222, "15": 3620463704, "16": 3620410222, "17": 3620463704, "18":... | {"0": 1534617656, "1": 1528166640, "2": 1529778822, "3": 1534552162, "4": 1534990028, "5": 1531589488, "6": 1531589488, "7": 1530674574, "8": 1530682868, "9": 1532346530, "10": 1531640968, "11": 1530674574, "12": 1531804846, "13": 1531804846, "14": 1531804846, "15": 1531629814, "16": 1531804846, "17": 1531629814, "18":... | [] | [] | ok | ok | 376,594,761,686 | 159,137,549,428 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 2.3665 | 2.366473 | 18.859914 | false | false | false | 0.206148 | 0.087035 | 2.36858 | 0.010832 | Accepted | Accepted | 0.010832 | 0.609849 | 0.124451 | 4 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.682148 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s674667124 | s320126379 | train | cpp | #include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 1e5 + 5;
int n, m, w[MAXN];
std::multiset<int> st[MAXN];
std::set<std::pair<int, int> > spec;
int fa[MAXN], part;
int Find(int x) {
return fa[x] == x ? x : fa[x] = Find(fa[x]);
}
void merge(int u, int v) {
if (Find(u) == Fi... | #include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
const int MAXN = 100000;
int n, m;
int fa[MAXN+5];
int val[MAXN+5];
vector <int> blk[MAXN+5];
vector <int> ansEdge;
long long int ans;
int SetFind(int x)
{
if(fa... | {"0": 6482133372, "1": 6469937188, "2": 6469962642, "3": 6484040992, "4": 6480482866, "5": 6470040148, "6": 6470040148, "7": 6471792470, "8": 6469071752, "9": 6469836516, "10": 6469965216, "11": 6471792470, "12": 6471602280, "13": 6471602280, "14": 6471602280, "15": 6470809774, "16": 6471602280, "17": 6470809774, "18":... | {"0": 3626660180, "1": 3620983938, "2": 3621575958, "3": 3626878684, "4": 3626374466, "5": 3623092044, "6": 3623092044, "7": 3621930312, "8": 3621813338, "9": 3622987368, "10": 3621698366, "11": 3621930312, "12": 3621993804, "13": 3621993804, "14": 3621993804, "15": 3621930598, "16": 3621993804, "17": 3621930598, "18":... | [] | [] | ok | ok | 673,004,531,056 | 376,696,235,058 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 1.7866 | 1.786597 | 33.704153 | false | false | false | 0.36841 | 0.206108 | 1.787456 | 0.010832 | Accepted | Accepted | 0.010832 | 0.453891 | 0.052553 | 3 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 33.386526 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s674667124 | s761681421 | train | cpp | #include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 1e5 + 5;
int n, m, w[MAXN];
std::multiset<int> st[MAXN];
std::set<std::pair<int, int> > spec;
int fa[MAXN], part;
int Find(int x) {
return fa[x] == x ? x : fa[x] = Find(fa[x]);
}
void merge(int u, int v) {
if (Find(u) == Fi... | #include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long LL;
int n,m;
LL a[100000+10];
int par[100000+10];
priority_queue<LL> mini[100000+10];
int fpar(int x){
if (par[x]==-1)return x;
par[x]=fpar(par[x]);
return par[x];
}
priority_queue <LL > pq1;
... | {"0": 6482133372, "1": 6469937188, "2": 6469962642, "3": 6484040992, "4": 6480482866, "5": 6470040148, "6": 6470040148, "7": 6471792470, "8": 6469071752, "9": 6469836516, "10": 6469965216, "11": 6471792470, "12": 6471602280, "13": 6471602280, "14": 6471602280, "15": 6470809774, "16": 6471602280, "17": 6470809774, "18":... | {"0": 4358968900, "1": 4350696064, "2": 4348510166, "3": 4359003506, "4": 4359725656, "5": 4353446526, "6": 4353446526, "7": 4353423074, "8": 4353123346, "9": 4353123346, "10": 4353123346, "11": 4353423074, "12": 4353278644, "13": 4353278644, "14": 4353278644, "15": 4353207716, "16": 4353278644, "17": 4353207716, "18":... | [] | [] | ok | ok | 673,004,531,056 | 452,531,685,606 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 1.487203 | 1.487199 | 33.704153 | false | false | false | 0.36841 | 0.247479 | 1.488649 | 0.010832 | Accepted | Accepted | 0.010832 | 0.338193 | 0.043767 | 2 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 33.386526 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s674667124 | s161991354 | train | cpp | #include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 1e5 + 5;
int n, m, w[MAXN];
std::multiset<int> st[MAXN];
std::set<std::pair<int, int> > spec;
int fa[MAXN], part;
int Find(int x) {
return fa[x] == x ? x : fa[x] = Find(fa[x]);
}
void merge(int u, int v) {
if (Find(u) == Fi... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)x.size())
const int N = 100005;
int n, m;
int a[N];
int fa[N];
vector<int> val[N];
int getfa(int x) {
return fa[x] == x ? x : fa[x] = getfa(fa[x]);
}
void merge(int x, int y) {
x = getfa(x);
y = getfa(y);
if(SZ(val[x]) < S... | {"0": 6482133372, "1": 6469937188, "2": 6469962642, "3": 6484040992, "4": 6480482866, "5": 6470040148, "6": 6470040148, "7": 6471792470, "8": 6469071752, "9": 6469836516, "10": 6469965216, "11": 6471792470, "12": 6471602280, "13": 6471602280, "14": 6471602280, "15": 6470809774, "16": 6471602280, "17": 6470809774, "18":... | {"0": 3626079314, "1": 3611310846, "2": 3609202740, "3": 3626091326, "4": 3626057578, "5": 3620167408, "6": 3620167408, "7": 3619971498, "8": 3619989802, "9": 3620437678, "10": 3619923164, "11": 3619971498, "12": 3620169124, "13": 3620169124, "14": 3620169124, "15": 3620208878, "16": 3620169124, "17": 3620208878, "18":... | [] | [] | ok | ok | 673,004,531,056 | 375,894,022,218 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 1.790438 | 1.79041 | 33.704153 | false | false | false | 0.36841 | 0.205394 | 1.793676 | 0.010832 | Accepted | Accepted | 0.010832 | 0.455889 | 0.052735 | 3 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 33.386526 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s761681421 | s161991354 | train | cpp | #include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long LL;
int n,m;
LL a[100000+10];
int par[100000+10];
priority_queue<LL> mini[100000+10];
int fpar(int x){
if (par[x]==-1)return x;
par[x]=fpar(par[x]);
return par[x];
}
priority_queue <LL > pq1;
... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)x.size())
const int N = 100005;
int n, m;
int a[N];
int fa[N];
vector<int> val[N];
int getfa(int x) {
return fa[x] == x ? x : fa[x] = getfa(fa[x]);
}
void merge(int x, int y) {
x = getfa(x);
y = getfa(y);
if(SZ(val[x]) < S... | {"0": 4358968900, "1": 4350696064, "2": 4348510166, "3": 4359003506, "4": 4359725656, "5": 4353446526, "6": 4353446526, "7": 4353423074, "8": 4353123346, "9": 4353123346, "10": 4353123346, "11": 4353423074, "12": 4353278644, "13": 4353278644, "14": 4353278644, "15": 4353207716, "16": 4353278644, "17": 4353207716, "18":... | {"0": 3626079314, "1": 3611310846, "2": 3609202740, "3": 3626091326, "4": 3626057578, "5": 3620167408, "6": 3620167408, "7": 3619971498, "8": 3619989802, "9": 3620437678, "10": 3619923164, "11": 3619971498, "12": 3620169124, "13": 3620169124, "14": 3620169124, "15": 3620208878, "16": 3620169124, "17": 3620208878, "18":... | [] | [] | ok | ok | 452,531,685,606 | 375,894,022,218 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 1.203896 | 1.203881 | 22.662845 | false | false | false | 0.247479 | 0.205394 | 1.204902 | 0.010832 | Accepted | Accepted | 0.010832 | 0.177841 | 0.052735 | 1 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 22.449203 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s674667124 | s042431628 | train | cpp | #include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 1e5 + 5;
int n, m, w[MAXN];
std::multiset<int> st[MAXN];
std::set<std::pair<int, int> > spec;
int fa[MAXN], part;
int Find(int x) {
return fa[x] == x ? x : fa[x] = Find(fa[x]);
}
void merge(int u, int v) {
if (Find(u) == Fi... | #include <cstdio>
#include <cstdlib>
#include <algorithm>
const int maxn = 1e5 + 20;
int n, m, A[maxn], F[maxn];
std::pair<int,int> M[maxn];
bool used[maxn];
int find(int x)
{
return F[x] == x ? x : (F[x] = find(F[x]));
}
template<class TAT>void checkmin(TAT &x,const TAT &y)
{
if(y < x) x = y;
}
... | {"0": 6482133372, "1": 6469937188, "2": 6469962642, "3": 6484040992, "4": 6480482866, "5": 6470040148, "6": 6470040148, "7": 6471792470, "8": 6469071752, "9": 6469836516, "10": 6469965216, "11": 6471792470, "12": 6471602280, "13": 6471602280, "14": 6471602280, "15": 6470809774, "16": 6471602280, "17": 6470809774, "18":... | {"0": 198856086, "1": 193839360, "2": 193148670, "3": 198705650, "4": 198848650, "5": 196741116, "6": 196741116, "7": 196699074, "8": 196717092, "9": 196703650, "10": 196737112, "11": 196699074, "12": 196803464, "13": 196803464, "14": 196803464, "15": 196730248, "16": 196803464, "17": 196730248, "18": 196710514, "19": ... | [] | [] | ok | ok | 673,004,531,056 | 20,264,053,810 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 33.214803 | 33.211742 | 33.704153 | false | false | false | 0.36841 | 0.010842 | 33.979785 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999971 | 0.999031 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 33.386526 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s320126379 | s042431628 | train | cpp | #include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
const int MAXN = 100000;
int n, m;
int fa[MAXN+5];
int val[MAXN+5];
vector <int> blk[MAXN+5];
vector <int> ansEdge;
long long int ans;
int SetFind(int x)
{
if(fa... | #include <cstdio>
#include <cstdlib>
#include <algorithm>
const int maxn = 1e5 + 20;
int n, m, A[maxn], F[maxn];
std::pair<int,int> M[maxn];
bool used[maxn];
int find(int x)
{
return F[x] == x ? x : (F[x] = find(F[x]));
}
template<class TAT>void checkmin(TAT &x,const TAT &y)
{
if(y < x) x = y;
}
... | {"0": 3626660180, "1": 3620983938, "2": 3621575958, "3": 3626878684, "4": 3626374466, "5": 3623092044, "6": 3623092044, "7": 3621930312, "8": 3621813338, "9": 3622987368, "10": 3621698366, "11": 3621930312, "12": 3621993804, "13": 3621993804, "14": 3621993804, "15": 3621930598, "16": 3621993804, "17": 3621930598, "18":... | {"0": 198856086, "1": 193839360, "2": 193148670, "3": 198705650, "4": 198848650, "5": 196741116, "6": 196741116, "7": 196699074, "8": 196717092, "9": 196703650, "10": 196737112, "11": 196699074, "12": 196803464, "13": 196803464, "14": 196803464, "15": 196730248, "16": 196803464, "17": 196730248, "18": 196710514, "19": ... | [] | [] | ok | ok | 376,696,235,058 | 20,264,053,810 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 18.59107 | 18.589382 | 18.864996 | false | false | false | 0.206108 | 0.010842 | 19.010134 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999946 | 0.999031 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.687187 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s761681421 | s042431628 | train | cpp | #include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long LL;
int n,m;
LL a[100000+10];
int par[100000+10];
priority_queue<LL> mini[100000+10];
int fpar(int x){
if (par[x]==-1)return x;
par[x]=fpar(par[x]);
return par[x];
}
priority_queue <LL > pq1;
... | #include <cstdio>
#include <cstdlib>
#include <algorithm>
const int maxn = 1e5 + 20;
int n, m, A[maxn], F[maxn];
std::pair<int,int> M[maxn];
bool used[maxn];
int find(int x)
{
return F[x] == x ? x : (F[x] = find(F[x]));
}
template<class TAT>void checkmin(TAT &x,const TAT &y)
{
if(y < x) x = y;
}
... | {"0": 4358968900, "1": 4350696064, "2": 4348510166, "3": 4359003506, "4": 4359725656, "5": 4353446526, "6": 4353446526, "7": 4353423074, "8": 4353123346, "9": 4353123346, "10": 4353123346, "11": 4353423074, "12": 4353278644, "13": 4353278644, "14": 4353278644, "15": 4353207716, "16": 4353278644, "17": 4353207716, "18":... | {"0": 198856086, "1": 193839360, "2": 193148670, "3": 198705650, "4": 198848650, "5": 196741116, "6": 196741116, "7": 196699074, "8": 196717092, "9": 196703650, "10": 196737112, "11": 196699074, "12": 196803464, "13": 196803464, "14": 196803464, "15": 196730248, "16": 196803464, "17": 196730248, "18": 196710514, "19": ... | [] | [] | ok | ok | 452,531,685,606 | 20,264,053,810 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 22.333736 | 22.331745 | 22.662845 | false | false | false | 0.247479 | 0.010842 | 22.825922 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999956 | 0.999031 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 22.449203 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s161991354 | s042431628 | train | cpp | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)x.size())
const int N = 100005;
int n, m;
int a[N];
int fa[N];
vector<int> val[N];
int getfa(int x) {
return fa[x] == x ? x : fa[x] = getfa(fa[x]);
}
void merge(int x, int y) {
x = getfa(x);
y = getfa(y);
if(SZ(val[x]) < S... | #include <cstdio>
#include <cstdlib>
#include <algorithm>
const int maxn = 1e5 + 20;
int n, m, A[maxn], F[maxn];
std::pair<int,int> M[maxn];
bool used[maxn];
int find(int x)
{
return F[x] == x ? x : (F[x] = find(F[x]));
}
template<class TAT>void checkmin(TAT &x,const TAT &y)
{
if(y < x) x = y;
}
... | {"0": 3626079314, "1": 3611310846, "2": 3609202740, "3": 3626091326, "4": 3626057578, "5": 3620167408, "6": 3620167408, "7": 3619971498, "8": 3619989802, "9": 3620437678, "10": 3619923164, "11": 3619971498, "12": 3620169124, "13": 3620169124, "14": 3620169124, "15": 3620208878, "16": 3620169124, "17": 3620208878, "18":... | {"0": 198856086, "1": 193839360, "2": 193148670, "3": 198705650, "4": 198848650, "5": 196741116, "6": 196741116, "7": 196699074, "8": 196717092, "9": 196703650, "10": 196737112, "11": 196699074, "12": 196803464, "13": 196803464, "14": 196803464, "15": 196730248, "16": 196803464, "17": 196730248, "18": 196710514, "19": ... | [] | [] | ok | ok | 375,894,022,218 | 20,264,053,810 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 18.551218 | 18.549794 | 18.824821 | false | false | false | 0.205394 | 0.010842 | 18.944216 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999946 | 0.999031 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.647129 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s674667124 | s981844310 | train | cpp | #include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 1e5 + 5;
int n, m, w[MAXN];
std::multiset<int> st[MAXN];
std::set<std::pair<int, int> > spec;
int fa[MAXN], part;
int Find(int x) {
return fa[x] == x ? x : fa[x] = Find(fa[x]);
}
void merge(int u, int v) {
if (Find(u) == Fi... | #include<cstdio>
#include<algorithm>
#include<cstring>
#define MN 200005
using namespace std;
typedef long long ll;
ll ans;
bool used[MN];
int n,m,fa[MN],id[MN],a[MN],sz[MN];
int getf(int x){return x==fa[x]?x:fa[x]=getf(fa[x]);}
bool cmp(int x,int y){return a[x]<a[y];}
int main(){
scanf("%d%d",&n,&m);int t... | {"0": 6482133372, "1": 6469937188, "2": 6469962642, "3": 6484040992, "4": 6480482866, "5": 6470040148, "6": 6470040148, "7": 6471792470, "8": 6469071752, "9": 6469836516, "10": 6469965216, "11": 6471792470, "12": 6471602280, "13": 6471602280, "14": 6471602280, "15": 6470809774, "16": 6471602280, "17": 6470809774, "18":... | {"0": 198991078, "1": 194575810, "2": 196022112, "3": 198786302, "4": 199046562, "5": 196706224, "6": 196706224, "7": 196572376, "8": 196572376, "9": 196664468, "10": 196661608, "11": 196572376, "12": 196737398, "13": 196737398, "14": 196737398, "15": 196686204, "16": 196737398, "17": 196686204, "18": 196572376, "19": ... | [] | [] | ok | ok | 673,004,531,056 | 20,370,955,176 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 33.038575 | 33.037456 | 33.704153 | false | false | false | 0.36841 | 0.010949 | 33.646999 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999671 | 0.989247 | 10 | 8 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 33.386526 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s320126379 | s981844310 | train | cpp | #include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
const int MAXN = 100000;
int n, m;
int fa[MAXN+5];
int val[MAXN+5];
vector <int> blk[MAXN+5];
vector <int> ansEdge;
long long int ans;
int SetFind(int x)
{
if(fa... | #include<cstdio>
#include<algorithm>
#include<cstring>
#define MN 200005
using namespace std;
typedef long long ll;
ll ans;
bool used[MN];
int n,m,fa[MN],id[MN],a[MN],sz[MN];
int getf(int x){return x==fa[x]?x:fa[x]=getf(fa[x]);}
bool cmp(int x,int y){return a[x]<a[y];}
int main(){
scanf("%d%d",&n,&m);int t... | {"0": 3626660180, "1": 3620983938, "2": 3621575958, "3": 3626878684, "4": 3626374466, "5": 3623092044, "6": 3623092044, "7": 3621930312, "8": 3621813338, "9": 3622987368, "10": 3621698366, "11": 3621930312, "12": 3621993804, "13": 3621993804, "14": 3621993804, "15": 3621930598, "16": 3621993804, "17": 3621930598, "18":... | {"0": 198991078, "1": 194575810, "2": 196022112, "3": 198786302, "4": 199046562, "5": 196706224, "6": 196706224, "7": 196572376, "8": 196572376, "9": 196664468, "10": 196661608, "11": 196572376, "12": 196737398, "13": 196737398, "14": 196737398, "15": 196686204, "16": 196737398, "17": 196686204, "18": 196572376, "19": ... | [] | [] | ok | ok | 376,696,235,058 | 20,370,955,176 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 18.492431 | 18.49183 | 18.864996 | false | false | false | 0.206108 | 0.010949 | 18.823955 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999397 | 0.989247 | 10 | 8 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.687187 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s761681421 | s981844310 | train | cpp | #include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long LL;
int n,m;
LL a[100000+10];
int par[100000+10];
priority_queue<LL> mini[100000+10];
int fpar(int x){
if (par[x]==-1)return x;
par[x]=fpar(par[x]);
return par[x];
}
priority_queue <LL > pq1;
... | #include<cstdio>
#include<algorithm>
#include<cstring>
#define MN 200005
using namespace std;
typedef long long ll;
ll ans;
bool used[MN];
int n,m,fa[MN],id[MN],a[MN],sz[MN];
int getf(int x){return x==fa[x]?x:fa[x]=getf(fa[x]);}
bool cmp(int x,int y){return a[x]<a[y];}
int main(){
scanf("%d%d",&n,&m);int t... | {"0": 4358968900, "1": 4350696064, "2": 4348510166, "3": 4359003506, "4": 4359725656, "5": 4353446526, "6": 4353446526, "7": 4353423074, "8": 4353123346, "9": 4353123346, "10": 4353123346, "11": 4353423074, "12": 4353278644, "13": 4353278644, "14": 4353278644, "15": 4353207716, "16": 4353278644, "17": 4353207716, "18":... | {"0": 198991078, "1": 194575810, "2": 196022112, "3": 198786302, "4": 199046562, "5": 196706224, "6": 196706224, "7": 196572376, "8": 196572376, "9": 196664468, "10": 196661608, "11": 196572376, "12": 196737398, "13": 196737398, "14": 196737398, "15": 196686204, "16": 196737398, "17": 196686204, "18": 196572376, "19": ... | [] | [] | ok | ok | 452,531,685,606 | 20,370,955,176 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 22.21524 | 22.214554 | 22.662845 | false | false | false | 0.247479 | 0.010949 | 22.602373 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999502 | 0.989247 | 10 | 8 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 22.449203 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s161991354 | s981844310 | train | cpp | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)x.size())
const int N = 100005;
int n, m;
int a[N];
int fa[N];
vector<int> val[N];
int getfa(int x) {
return fa[x] == x ? x : fa[x] = getfa(fa[x]);
}
void merge(int x, int y) {
x = getfa(x);
y = getfa(y);
if(SZ(val[x]) < S... | #include<cstdio>
#include<algorithm>
#include<cstring>
#define MN 200005
using namespace std;
typedef long long ll;
ll ans;
bool used[MN];
int n,m,fa[MN],id[MN],a[MN],sz[MN];
int getf(int x){return x==fa[x]?x:fa[x]=getf(fa[x]);}
bool cmp(int x,int y){return a[x]<a[y];}
int main(){
scanf("%d%d",&n,&m);int t... | {"0": 3626079314, "1": 3611310846, "2": 3609202740, "3": 3626091326, "4": 3626057578, "5": 3620167408, "6": 3620167408, "7": 3619971498, "8": 3619989802, "9": 3620437678, "10": 3619923164, "11": 3619971498, "12": 3620169124, "13": 3620169124, "14": 3620169124, "15": 3620208878, "16": 3620169124, "17": 3620208878, "18":... | {"0": 198991078, "1": 194575810, "2": 196022112, "3": 198786302, "4": 199046562, "5": 196706224, "6": 196706224, "7": 196572376, "8": 196572376, "9": 196664468, "10": 196661608, "11": 196572376, "12": 196737398, "13": 196737398, "14": 196737398, "15": 196686204, "16": 196737398, "17": 196686204, "18": 196572376, "19": ... | [] | [] | ok | ok | 375,894,022,218 | 20,370,955,176 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 18.452791 | 18.45245 | 18.824821 | false | false | false | 0.205394 | 0.010949 | 18.758683 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999395 | 0.989247 | 10 | 8 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.647129 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s674667124 | s134276380 | train | cpp | #include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 1e5 + 5;
int n, m, w[MAXN];
std::multiset<int> st[MAXN];
std::set<std::pair<int, int> > spec;
int fa[MAXN], part;
int Find(int x) {
return fa[x] == x ? x : fa[x] = Find(fa[x]);
}
void merge(int u, int v) {
if (Find(u) == Fi... | #include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
#include<vector>
using std::vector;
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define reg register
typedef long long ll;
inline int read(){
reg int x=0,f=1;reg char ch=getchar();
for(;!isdigit(ch);f=ch=='-'?-1:1,ch=g... | {"0": 6482133372, "1": 6469937188, "2": 6469962642, "3": 6484040992, "4": 6480482866, "5": 6470040148, "6": 6470040148, "7": 6471792470, "8": 6469071752, "9": 6469836516, "10": 6469965216, "11": 6471792470, "12": 6471602280, "13": 6471602280, "14": 6471602280, "15": 6470809774, "16": 6471602280, "17": 6470809774, "18":... | {"0": 3529437912, "1": 3523759382, "2": 3519089002, "3": 3529401304, "4": 3529413888, "5": 3528326230, "6": 3528326230, "7": 3528230134, "8": 3528230134, "9": 3528301062, "10": 3528425186, "11": 3528230134, "12": 3528229276, "13": 3528229276, "14": 3528229276, "15": 3528229276, "16": 3528229276, "17": 3528229276, "18":... | [] | [] | ok | ok | 673,004,531,056 | 366,521,704,120 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 1.836212 | 1.836193 | 33.704153 | false | false | false | 0.36841 | 0.200231 | 1.839919 | 0.010832 | Accepted | Accepted | 0.010832 | 0.470326 | 0.054095 | 3 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 33.386526 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s761681421 | s134276380 | train | cpp | #include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long LL;
int n,m;
LL a[100000+10];
int par[100000+10];
priority_queue<LL> mini[100000+10];
int fpar(int x){
if (par[x]==-1)return x;
par[x]=fpar(par[x]);
return par[x];
}
priority_queue <LL > pq1;
... | #include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
#include<vector>
using std::vector;
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define reg register
typedef long long ll;
inline int read(){
reg int x=0,f=1;reg char ch=getchar();
for(;!isdigit(ch);f=ch=='-'?-1:1,ch=g... | {"0": 4358968900, "1": 4350696064, "2": 4348510166, "3": 4359003506, "4": 4359725656, "5": 4353446526, "6": 4353446526, "7": 4353423074, "8": 4353123346, "9": 4353123346, "10": 4353123346, "11": 4353423074, "12": 4353278644, "13": 4353278644, "14": 4353278644, "15": 4353207716, "16": 4353278644, "17": 4353207716, "18":... | {"0": 3529437912, "1": 3523759382, "2": 3519089002, "3": 3529401304, "4": 3529413888, "5": 3528326230, "6": 3528326230, "7": 3528230134, "8": 3528230134, "9": 3528301062, "10": 3528425186, "11": 3528230134, "12": 3528229276, "13": 3528229276, "14": 3528229276, "15": 3528229276, "16": 3528229276, "17": 3528229276, "18":... | [] | [] | ok | ok | 452,531,685,606 | 366,521,704,120 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 1.234675 | 1.234665 | 22.662845 | false | false | false | 0.247479 | 0.200231 | 1.235966 | 0.010832 | Accepted | Accepted | 0.010832 | 0.199655 | 0.054095 | 1 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 22.449203 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s674667124 | s962600339 | train | cpp | #include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 1e5 + 5;
int n, m, w[MAXN];
std::multiset<int> st[MAXN];
std::set<std::pair<int, int> > spec;
int fa[MAXN], part;
int Find(int x) {
return fa[x] == x ? x : fa[x] = Find(fa[x]);
}
void merge(int u, int v) {
if (Find(u) == Fi... | #include<cstdio>
#include<cstring>
#include<algorithm>
int n,m;
int a[100001];
int fa[100001];
int us[100001],val[100001],num[100001],re[100001],p,cnt;
int gf(int x){return fa[x]==x?x:(fa[x]=gf(fa[x]));}
long long ans=0;
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=... | {"0": 6482133372, "1": 6469937188, "2": 6469962642, "3": 6484040992, "4": 6480482866, "5": 6470040148, "6": 6470040148, "7": 6471792470, "8": 6469071752, "9": 6469836516, "10": 6469965216, "11": 6471792470, "12": 6471602280, "13": 6471602280, "14": 6471602280, "15": 6470809774, "16": 6471602280, "17": 6470809774, "18":... | {"0": 198689348, "1": 193136658, "2": 192471994, "3": 198677050, "4": 198742544, "5": 196415648, "6": 196415648, "7": 196494298, "8": 196415648, "9": 196415648, "10": 196415648, "11": 196494298, "12": 196415648, "13": 196415648, "14": 196415648, "15": 196438242, "16": 196415648, "17": 196438242, "18": 196415648, "19": ... | [] | [] | ok | ok | 673,004,531,056 | 20,211,237,618 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 33.301963 | 33.298531 | 33.704153 | false | false | false | 0.36841 | 0.010839 | 33.990676 | 0.010832 | Accepted | Accepted | 0.010832 | 0.99998 | 0.999351 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 33.386526 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s320126379 | s962600339 | train | cpp | #include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
const int MAXN = 100000;
int n, m;
int fa[MAXN+5];
int val[MAXN+5];
vector <int> blk[MAXN+5];
vector <int> ansEdge;
long long int ans;
int SetFind(int x)
{
if(fa... | #include<cstdio>
#include<cstring>
#include<algorithm>
int n,m;
int a[100001];
int fa[100001];
int us[100001],val[100001],num[100001],re[100001],p,cnt;
int gf(int x){return fa[x]==x?x:(fa[x]=gf(fa[x]));}
long long ans=0;
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=... | {"0": 3626660180, "1": 3620983938, "2": 3621575958, "3": 3626878684, "4": 3626374466, "5": 3623092044, "6": 3623092044, "7": 3621930312, "8": 3621813338, "9": 3622987368, "10": 3621698366, "11": 3621930312, "12": 3621993804, "13": 3621993804, "14": 3621993804, "15": 3621930598, "16": 3621993804, "17": 3621930598, "18":... | {"0": 198689348, "1": 193136658, "2": 192471994, "3": 198677050, "4": 198742544, "5": 196415648, "6": 196415648, "7": 196494298, "8": 196415648, "9": 196415648, "10": 196415648, "11": 196494298, "12": 196415648, "13": 196415648, "14": 196415648, "15": 196438242, "16": 196415648, "17": 196438242, "18": 196415648, "19": ... | [] | [] | ok | ok | 376,696,235,058 | 20,211,237,618 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 18.639855 | 18.63796 | 18.864996 | false | false | false | 0.206108 | 0.010839 | 19.016227 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999964 | 0.999351 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.687187 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s761681421 | s962600339 | train | cpp | #include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long LL;
int n,m;
LL a[100000+10];
int par[100000+10];
priority_queue<LL> mini[100000+10];
int fpar(int x){
if (par[x]==-1)return x;
par[x]=fpar(par[x]);
return par[x];
}
priority_queue <LL > pq1;
... | #include<cstdio>
#include<cstring>
#include<algorithm>
int n,m;
int a[100001];
int fa[100001];
int us[100001],val[100001],num[100001],re[100001],p,cnt;
int gf(int x){return fa[x]==x?x:(fa[x]=gf(fa[x]));}
long long ans=0;
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=... | {"0": 4358968900, "1": 4350696064, "2": 4348510166, "3": 4359003506, "4": 4359725656, "5": 4353446526, "6": 4353446526, "7": 4353423074, "8": 4353123346, "9": 4353123346, "10": 4353123346, "11": 4353423074, "12": 4353278644, "13": 4353278644, "14": 4353278644, "15": 4353207716, "16": 4353278644, "17": 4353207716, "18":... | {"0": 198689348, "1": 193136658, "2": 192471994, "3": 198677050, "4": 198742544, "5": 196415648, "6": 196415648, "7": 196494298, "8": 196415648, "9": 196415648, "10": 196415648, "11": 196494298, "12": 196415648, "13": 196415648, "14": 196415648, "15": 196438242, "16": 196415648, "17": 196438242, "18": 196415648, "19": ... | [] | [] | ok | ok | 452,531,685,606 | 20,211,237,618 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 22.392343 | 22.390103 | 22.662845 | false | false | false | 0.247479 | 0.010839 | 22.833238 | 0.010832 | Accepted | Accepted | 0.010832 | 0.99997 | 0.999351 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 22.449203 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s161991354 | s962600339 | train | cpp | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)x.size())
const int N = 100005;
int n, m;
int a[N];
int fa[N];
vector<int> val[N];
int getfa(int x) {
return fa[x] == x ? x : fa[x] = getfa(fa[x]);
}
void merge(int x, int y) {
x = getfa(x);
y = getfa(y);
if(SZ(val[x]) < S... | #include<cstdio>
#include<cstring>
#include<algorithm>
int n,m;
int a[100001];
int fa[100001];
int us[100001],val[100001],num[100001],re[100001],p,cnt;
int gf(int x){return fa[x]==x?x:(fa[x]=gf(fa[x]));}
long long ans=0;
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=... | {"0": 3626079314, "1": 3611310846, "2": 3609202740, "3": 3626091326, "4": 3626057578, "5": 3620167408, "6": 3620167408, "7": 3619971498, "8": 3619989802, "9": 3620437678, "10": 3619923164, "11": 3619971498, "12": 3620169124, "13": 3620169124, "14": 3620169124, "15": 3620208878, "16": 3620169124, "17": 3620208878, "18":... | {"0": 198689348, "1": 193136658, "2": 192471994, "3": 198677050, "4": 198742544, "5": 196415648, "6": 196415648, "7": 196494298, "8": 196415648, "9": 196415648, "10": 196415648, "11": 196494298, "12": 196415648, "13": 196415648, "14": 196415648, "15": 196438242, "16": 196415648, "17": 196438242, "18": 196415648, "19": ... | [] | [] | ok | ok | 375,894,022,218 | 20,211,237,618 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 18.599899 | 18.598268 | 18.824821 | false | false | false | 0.205394 | 0.010839 | 18.950287 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999964 | 0.999351 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.647129 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s134276380 | s962600339 | train | cpp | #include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
#include<vector>
using std::vector;
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define reg register
typedef long long ll;
inline int read(){
reg int x=0,f=1;reg char ch=getchar();
for(;!isdigit(ch);f=ch=='-'?-1:1,ch=g... | #include<cstdio>
#include<cstring>
#include<algorithm>
int n,m;
int a[100001];
int fa[100001];
int us[100001],val[100001],num[100001],re[100001],p,cnt;
int gf(int x){return fa[x]==x?x:(fa[x]=gf(fa[x]));}
long long ans=0;
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=... | {"0": 3529437912, "1": 3523759382, "2": 3519089002, "3": 3529401304, "4": 3529413888, "5": 3528326230, "6": 3528326230, "7": 3528230134, "8": 3528230134, "9": 3528301062, "10": 3528425186, "11": 3528230134, "12": 3528229276, "13": 3528229276, "14": 3528229276, "15": 3528229276, "16": 3528229276, "17": 3528229276, "18":... | {"0": 198689348, "1": 193136658, "2": 192471994, "3": 198677050, "4": 198742544, "5": 196415648, "6": 196415648, "7": 196494298, "8": 196415648, "9": 196415648, "10": 196415648, "11": 196494298, "12": 196415648, "13": 196415648, "14": 196415648, "15": 196438242, "16": 196415648, "17": 196438242, "18": 196415648, "19": ... | [] | [] | ok | ok | 366,521,704,120 | 20,211,237,618 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 18.136228 | 18.13455 | 18.355454 | false | false | false | 0.200231 | 0.010839 | 18.474002 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999963 | 0.999351 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.182281 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s674667124 | s687836785 | train | cpp | #include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 1e5 + 5;
int n, m, w[MAXN];
std::multiset<int> st[MAXN];
std::set<std::pair<int, int> > spec;
int fa[MAXN], part;
int Find(int x) {
return fa[x] == x ? x : fa[x] = Find(fa[x]);
}
void merge(int u, int v) {
if (Find(u) == Fi... | #include<cstdio>
#include<algorithm>
#define F(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
typedef long long ll;
int n,m;
int a[100001],b[100001],t;
int fa[100001];
int ff(int x){return fa[x]?fa[x]=ff(fa[x]):x;}
ll Sum;
int main(){
int x,y;
scanf("%d%d",&n,&m);
if(m==n-1) return puts("0"),... | {"0": 6482133372, "1": 6469937188, "2": 6469962642, "3": 6484040992, "4": 6480482866, "5": 6470040148, "6": 6470040148, "7": 6471792470, "8": 6469071752, "9": 6469836516, "10": 6469965216, "11": 6471792470, "12": 6471602280, "13": 6471602280, "14": 6471602280, "15": 6470809774, "16": 6471602280, "17": 6470809774, "18":... | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [] | [] | ok | ok | 673,004,531,056 | 20,159,856,574 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 33.386526 | 33.383399 | 33.704153 | false | false | false | 0.36841 | 0.010832 | 34.012738 | 0.010832 | Accepted | Accepted | 0.010832 | 1 | 1 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 33.386526 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s320126379 | s687836785 | train | cpp | #include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
const int MAXN = 100000;
int n, m;
int fa[MAXN+5];
int val[MAXN+5];
vector <int> blk[MAXN+5];
vector <int> ansEdge;
long long int ans;
int SetFind(int x)
{
if(fa... | #include<cstdio>
#include<algorithm>
#define F(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
typedef long long ll;
int n,m;
int a[100001],b[100001],t;
int fa[100001];
int ff(int x){return fa[x]?fa[x]=ff(fa[x]):x;}
ll Sum;
int main(){
int x,y;
scanf("%d%d",&n,&m);
if(m==n-1) return puts("0"),... | {"0": 3626660180, "1": 3620983938, "2": 3621575958, "3": 3626878684, "4": 3626374466, "5": 3623092044, "6": 3623092044, "7": 3621930312, "8": 3621813338, "9": 3622987368, "10": 3621698366, "11": 3621930312, "12": 3621993804, "13": 3621993804, "14": 3621993804, "15": 3621930598, "16": 3621993804, "17": 3621930598, "18":... | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [] | [] | ok | ok | 376,696,235,058 | 20,159,856,574 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 18.687187 | 18.685462 | 18.864996 | false | false | false | 0.206108 | 0.010832 | 19.02857 | 0.010832 | Accepted | Accepted | 0.010832 | 1 | 1 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.687187 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s761681421 | s687836785 | train | cpp | #include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long LL;
int n,m;
LL a[100000+10];
int par[100000+10];
priority_queue<LL> mini[100000+10];
int fpar(int x){
if (par[x]==-1)return x;
par[x]=fpar(par[x]);
return par[x];
}
priority_queue <LL > pq1;
... | #include<cstdio>
#include<algorithm>
#define F(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
typedef long long ll;
int n,m;
int a[100001],b[100001],t;
int fa[100001];
int ff(int x){return fa[x]?fa[x]=ff(fa[x]):x;}
ll Sum;
int main(){
int x,y;
scanf("%d%d",&n,&m);
if(m==n-1) return puts("0"),... | {"0": 4358968900, "1": 4350696064, "2": 4348510166, "3": 4359003506, "4": 4359725656, "5": 4353446526, "6": 4353446526, "7": 4353423074, "8": 4353123346, "9": 4353123346, "10": 4353123346, "11": 4353423074, "12": 4353278644, "13": 4353278644, "14": 4353278644, "15": 4353207716, "16": 4353278644, "17": 4353207716, "18":... | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [] | [] | ok | ok | 452,531,685,606 | 20,159,856,574 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 22.449203 | 22.447168 | 22.662845 | false | false | false | 0.247479 | 0.010832 | 22.848058 | 0.010832 | Accepted | Accepted | 0.010832 | 1 | 1 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 22.449203 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s161991354 | s687836785 | train | cpp | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)x.size())
const int N = 100005;
int n, m;
int a[N];
int fa[N];
vector<int> val[N];
int getfa(int x) {
return fa[x] == x ? x : fa[x] = getfa(fa[x]);
}
void merge(int x, int y) {
x = getfa(x);
y = getfa(y);
if(SZ(val[x]) < S... | #include<cstdio>
#include<algorithm>
#define F(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
typedef long long ll;
int n,m;
int a[100001],b[100001],t;
int fa[100001];
int ff(int x){return fa[x]?fa[x]=ff(fa[x]):x;}
ll Sum;
int main(){
int x,y;
scanf("%d%d",&n,&m);
if(m==n-1) return puts("0"),... | {"0": 3626079314, "1": 3611310846, "2": 3609202740, "3": 3626091326, "4": 3626057578, "5": 3620167408, "6": 3620167408, "7": 3619971498, "8": 3619989802, "9": 3620437678, "10": 3619923164, "11": 3619971498, "12": 3620169124, "13": 3620169124, "14": 3620169124, "15": 3620208878, "16": 3620169124, "17": 3620208878, "18":... | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [] | [] | ok | ok | 375,894,022,218 | 20,159,856,574 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 18.647129 | 18.645669 | 18.824821 | false | false | false | 0.205394 | 0.010832 | 18.962587 | 0.010832 | Accepted | Accepted | 0.010832 | 1 | 1 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.647129 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s134276380 | s687836785 | train | cpp | #include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
#include<vector>
using std::vector;
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define reg register
typedef long long ll;
inline int read(){
reg int x=0,f=1;reg char ch=getchar();
for(;!isdigit(ch);f=ch=='-'?-1:1,ch=g... | #include<cstdio>
#include<algorithm>
#define F(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
typedef long long ll;
int n,m;
int a[100001],b[100001],t;
int fa[100001];
int ff(int x){return fa[x]?fa[x]=ff(fa[x]):x;}
ll Sum;
int main(){
int x,y;
scanf("%d%d",&n,&m);
if(m==n-1) return puts("0"),... | {"0": 3529437912, "1": 3523759382, "2": 3519089002, "3": 3529401304, "4": 3529413888, "5": 3528326230, "6": 3528326230, "7": 3528230134, "8": 3528230134, "9": 3528301062, "10": 3528425186, "11": 3528230134, "12": 3528229276, "13": 3528229276, "14": 3528229276, "15": 3528229276, "16": 3528229276, "17": 3528229276, "18":... | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [] | [] | ok | ok | 366,521,704,120 | 20,159,856,574 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 18.182281 | 18.180769 | 18.355454 | false | false | false | 0.200231 | 0.010832 | 18.485993 | 0.010832 | Accepted | Accepted | 0.010832 | 1 | 1 | 10 | 10 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 18.182281 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s674667124 | s836320341 | train | cpp | #include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 1e5 + 5;
int n, m, w[MAXN];
std::multiset<int> st[MAXN];
std::set<std::pair<int, int> > spec;
int fa[MAXN], part;
int Find(int x) {
return fa[x] == x ? x : fa[x] = Find(fa[x]);
}
void merge(int u, int v) {
if (Find(u) == Fi... | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#define mp(x,y) make_pair(x,y)
#define ll long long
#define MN 200005
using namespace std;
inline ll in(){
ll x=0;bool f=0;char c;
for (;(c=getchar())<'0'||c>'9';f=c=='-');
for (x=c-'0';(c=getchar())>='0'&&c<='9';x=(x<<3)+(x<... | {"0": 6482133372, "1": 6469937188, "2": 6469962642, "3": 6484040992, "4": 6480482866, "5": 6470040148, "6": 6470040148, "7": 6471792470, "8": 6469071752, "9": 6469836516, "10": 6469965216, "11": 6471792470, "12": 6471602280, "13": 6471602280, "14": 6471602280, "15": 6470809774, "16": 6471602280, "17": 6470809774, "18":... | {"0": 2586630046, "1": 2579811234, "2": 2579466604, "3": 2586738726, "4": 2586640056, "5": 2581867002, "6": 2581867002, "7": 2581760896, "8": 2581760896, "9": 2582082646, "10": 2581788924, "11": 2581760896, "12": 2581878156, "13": 2581878156, "14": 2581878156, "15": 2581878156, "16": 2581878156, "17": 2581878156, "18":... | [] | [] | ok | ok | 673,004,531,056 | 268,403,498,220 | [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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 104 | 103 | 103 | 104 | 0 | 0 | 0 | 2.507446 | 2.507436 | 33.704153 | false | false | false | 0.36841 | 0.146476 | 2.515146 | 0.010832 | Accepted | Accepted | 0.010832 | 0.620657 | 0.073947 | 4 | 1 | s687836785 | {"0": 198248908, "1": 192950186, "2": 191967490, "3": 198158532, "4": 198248908, "5": 195654030, "6": 195654030, "7": 195564226, "8": 195454116, "9": 195803608, "10": 195564226, "11": 195564226, "12": 195654316, "13": 195654316, "14": 195654316, "15": 195571662, "16": 195654316, "17": 195571662, "18": 195729248, "19": ... | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 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, 8... | 19,964,127,326 | 33.386526 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.