problem_id stringlengths 6 6 | src_id stringlengths 10 10 | split stringclasses 1
value | language stringclasses 1
value | src_code stringlengths 60 490k | gem5_src_per_tc_ticks stringlengths 16 2.01k | gem5_src_excluded stringclasses 324
values | gem5_src_status stringclasses 2
values | gem5_src_sum_ticks_all int64 193M 1,762B | oracle_tgt_id stringlengths 10 10 | oracle_tgt_code stringlengths 54 149k | gem5_oracle_tgt_per_tc_ticks stringlengths 16 1.95k | gem5_oracle_tgt_status stringclasses 2
values | our_speedup_usable float64 0.66 70.3 | our_speedup_all float64 0.2 70.3 | timed_case_ids stringclasses 416
values | correctness_kept_case_ids stringclasses 385
values | usable_case_ids stringclasses 679
values | n_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 | 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_speedup float64 1.1 71.5 | pie_src_agg_runtime float64 0 1.45 | pie_oracle_tgt_agg_runtime float64 0 1.03 | pie_fastest_agg_runtime float64 0 0.36 | pie_src_verdict stringclasses 1
value | pie_oracle_tgt_verdict stringclasses 1
value | pie_fastest_agg_runtime_updated float64 0 0.36 | pie_src_reward_updated float64 0.1 1 | pie_src_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 659
values | gem5_fastest_sum_ticks_usable int64 0 1,027B | our_fastest_speedup float64 0.99 73.4 ⌀ | pie_n_tests float64 | pie_test_accuracy float64 | pie_src_code_accuracy float64 | pie_src_code_compilation float64 | pie_src_code_tc2time stringclasses 0
values | pie_oracle_tgt_code_tc2time stringclasses 0
values | pie_fastest_code stringclasses 0
values | pie_fastest_code_len float64 | pie_fastest_code_runtime float64 | pie_fastest_code_tc2time stringclasses 0
values | pie_tests_case_ids stringclasses 0
values |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p03352 | s743140059 | 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;
}
}}
... | {"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... | [23, 37, 39, 40, 41, 42, 43, 44, 102] | ok | 277,242,138,316 | s147468699 | #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": 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":... | ok | 2.174407 | 2.860168 | [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... | [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... | 91 | 104 | 91 | 104 | 0 | 11.555162 | false | false | false | 1.197848 | 0.088454 | 0.073844 | 0.013899 | Accepted | Accepted | 0.013899 | 0.19596 | 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, 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 |
p03352 | s383032031 | 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)){
... | {"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":... | [] | ok | 139,418,562,712 | s798553866 | #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": 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 | 1.286375 | 1.286375 | [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 | 6.982099 | false | false | false | 1.286385 | 0.097422 | 0.075733 | 0.013899 | Accepted | Accepted | 0.013899 | 0.259674 | 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, 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 |
p03352 | s544288094 | 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_... | {"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... | [13, 23, 33, 37, 39, 40, 41, 42, 43, 44, 102] | ok | 275,837,565,146 | s646099306 | #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": 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":... | ok | 2.069805 | 2.901647 | [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, ... | [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, ... | 88 | 104 | 88 | 104 | 0 | 11.0192 | false | false | false | 1.232089 | 0.091314 | 0.074113 | 0.013899 | Accepted | Accepted | 0.013899 | 0.222189 | 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, 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 |
p03352 | s824081779 | 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 ;
} | {"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... | [23, 37, 39, 40, 41, 42, 43, 44, 102] | ok | 289,554,485,506 | s759631282 | #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": 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":... | ok | 2.120665 | 2.94162 | [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, 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, ... | 90 | 104 | 90 | 104 | 0 | 11.419836 | false | false | false | 1.221533 | 0.091313 | 0.074753 | 0.013899 | Accepted | Accepted | 0.013899 | 0.213917 | 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, 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 |
p03352 | s648785595 | 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;... | {"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"... | [1, 12, 13, 23, 33, 34, 37, 39, 40, 41, 42, 43, 44, 102] | ok | 287,423,359,938 | s450771019 | /** 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": 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... | ok | 1.313674 | 1.444981 | [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, ... | [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, ... | 85 | 104 | 85 | 104 | 0 | 11.679128 | false | false | false | 1.138788 | 0.10573 | 0.092845 | 0.013899 | Accepted | Accepted | 0.013899 | 0.140319 | 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 |
p03352 | s954146983 | 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... | {"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... | [23, 37, 39, 40, 41, 42, 43, 44, 102] | ok | 278,851,726,582 | s080418400 | #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": 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":... | ok | 2.165 | 2.843942 | [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... | [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... | 91 | 104 | 91 | 104 | 0 | 11.637573 | false | false | false | 1.188123 | 0.088699 | 0.074655 | 0.013899 | Accepted | Accepted | 0.013899 | 0.187756 | 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, 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 |
p03352 | s523411834 | 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;
} | {"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":... | [44] | ok | 315,124,393,870 | s048804173 | #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": 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":... | ok | 2.51372 | 2.949353 | [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... | [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... | 100 | 104 | 100 | 104 | 0 | 13.58101 | false | false | false | 1.206138 | 0.09126 | 0.075663 | 0.013899 | Accepted | Accepted | 0.013899 | 0.201612 | 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, 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 |
p03352 | s936464260 | 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(){
... | {"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... | [23, 37, 39, 40, 41, 42, 43, 44, 102] | ok | 278,851,726,582 | s334519600 | #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": 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":... | ok | 2.185947 | 2.871591 | [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... | [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... | 91 | 104 | 91 | 104 | 0 | 11.637573 | false | false | false | 1.196875 | 0.088699 | 0.074109 | 0.013899 | Accepted | Accepted | 0.013899 | 0.195054 | 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, 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 |
p03352 | s086696291 | 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... | {"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"... | [1, 12, 13, 23, 33, 34, 37, 39, 40, 41, 42, 43, 44, 76, 102] | ok | 237,989,312,132 | s794890605 | #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": 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":... | ok | 1.874069 | 2.580866 | [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, ... | [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, ... | 85 | 104 | 85 | 104 | 0 | 10.113027 | false | false | false | 1.20781 | 0.090852 | 0.075221 | 0.013899 | Accepted | Accepted | 0.013899 | 0.20313 | 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 | 1.903087 | null | null | null | null | null | null | null | null | null | null | null |
p03352 | s367597367 | 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;
... | {"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... | [23, 37, 39, 40, 41, 42, 43, 44, 102] | ok | 286,332,719,530 | s401673396 | #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": 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":... | ok | 2.228914 | 2.91871 | [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... | [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... | 91 | 104 | 91 | 104 | 0 | 11.974226 | false | false | false | 1.213676 | 0.090661 | 0.0747 | 0.013899 | Accepted | Accepted | 0.013899 | 0.207934 | 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, 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 |
p03891 | s934094873 | 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++){... | {"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":... | [] | ok | 105,492,105,290 | s908179494 | #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": 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 | 5.208378 | 5.208378 | [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 | 5.33435 | false | false | false | 5.31541 | 0.025472 | 0.004792 | 0.004792 | Accepted | Accepted | 0.004792 | 1 | 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 |
p03891 | s218972214 | 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;
}
| {"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":... | [] | ok | 105,575,422,524 | s908179494 | #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": 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 | 5.212492 | 5.212492 | [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 | 5.338563 | false | false | false | 5.305361 | 0.025424 | 0.004792 | 0.004792 | Accepted | Accepted | 0.004792 | 1 | 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 |
p03891 | s879637459 | 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... | {"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":... | [] | ok | 341,264,859,936 | s999078666 | #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": 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 | 3.229513 | 3.229513 | [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 | 17.256516 | false | false | false | 3.244736 | 0.082649 | 0.025472 | 0.004792 | Accepted | Accepted | 0.004792 | 0.73439 | 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 |
p00232 | s133996477 | 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)... | {"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":... | [] | ok | 568,216,274,054 | s200731165 | #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": 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 | 1.103215 | 1.103215 | [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 | 29.014311 | false | false | false | 1.103285 | 0.562508 | 0.509848 | 0.025842 | Accepted | Accepted | 0.025842 | 0.098124 | 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 |
p00232 | s987198074 | 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... | {"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":... | [] | ok | 200,457,093,980 | s728528188 | #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": 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 | 1.415602 | 1.415602 | [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 | 10.235758 | false | false | false | 1.423894 | 0.198082 | 0.139113 | 0.025842 | Accepted | Accepted | 0.025842 | 0.342365 | 2 | 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 |
p00232 | s457062022 | 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,... | {"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":... | [] | ok | 192,160,987,590 | s629291450 | #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": 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 | 6.149511 | 6.149511 | [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 | 9.812142 | false | false | false | 6.246177 | 0.189675 | 0.030367 | 0.025842 | Accepted | Accepted | 0.025842 | 0.97238 | 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 |
p00232 | s288098895 | 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++){
... | {"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 | 116,110,849,712 | s629291450 | #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": 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 | 3.715764 | 3.715764 | [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 | 5.928863 | false | false | false | 3.761555 | 0.114226 | 0.030367 | 0.025842 | Accepted | Accepted | 0.025842 | 0.948802 | 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 |
p00232 | s441517966 | 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... | {"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":... | [] | ok | 196,948,587,550 | s945344504 | #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": 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 | 1.285078 | 1.285078 | [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 | 10.056607 | false | false | false | 1.286329 | 0.194465 | 0.151179 | 0.025842 | Accepted | Accepted | 0.025842 | 0.256706 | 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 |
p03078 | s258228842 | 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... | {"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":... | [] | ok | 112,675,700,280 | s669931122 | #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": 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 | 5.419142 | 5.419142 | [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 | 5.642814 | false | false | false | 5.484056 | 0.112089 | 0.020439 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 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 |
p03078 | s472072770 | 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()... | {"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":... | [] | ok | 111,976,610,746 | s669931122 | #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": 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 | 5.38552 | 5.38552 | [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 | 5.607803 | false | false | false | 5.447509 | 0.111342 | 0.020439 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 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 |
p03078 | s139408187 | 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()... | {"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":... | [] | ok | 111,983,324,310 | s669931122 | #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": 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 | 5.385843 | 5.385843 | [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 | 5.608139 | false | false | false | 5.446382 | 0.111319 | 0.020439 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 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 |
p03078 | s557761618 | 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... | {"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":... | [] | ok | 111,299,679,634 | s669931122 | #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": 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 | 5.352963 | 5.352963 | [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 | 5.573902 | false | false | false | 5.412083 | 0.110618 | 0.020439 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 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 |
p03078 | s696792025 | 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()... | {"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":... | [] | ok | 110,962,151,872 | s669931122 | #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": 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 | 5.336729 | 5.336729 | [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 | 5.556999 | false | false | false | 5.388813 | 0.110142 | 0.020439 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 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 |
p03078 | s040926137 | 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; ... | {"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":... | [] | ok | 110,908,813,730 | s669931122 | #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": 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 | 5.334164 | 5.334164 | [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 | 5.554328 | false | false | false | 5.379684 | 0.109955 | 0.020439 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 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 |
p03078 | s375569918 | 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)... | {"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": ... | [] | ok | 102,193,936,988 | s669931122 | #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": 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 | 4.915022 | 4.915022 | [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 | 5.117885 | false | false | false | 4.988615 | 0.101962 | 0.020439 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 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 |
p03078 | s043585867 | 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 < ... | {"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 | 101,004,537,920 | s669931122 | #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": 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 | 4.857817 | 4.857817 | [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 | 5.05832 | false | false | false | 4.92288 | 0.100619 | 0.020439 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 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 |
p03078 | s779400339 | 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 = ... | {"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 | 100,482,176,938 | s669931122 | #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": 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 | 4.832694 | 4.832694 | [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 | 5.03216 | false | false | false | 4.909485 | 0.100345 | 0.020439 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 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 |
p03078 | s634610038 | 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 * ... | {"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 | 100,786,967,996 | s669931122 | #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": 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 | 4.847353 | 4.847353 | [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 | 5.047424 | false | false | false | 4.873229 | 0.099604 | 0.020439 | 0.020439 | Accepted | Accepted | 0.020439 | 1 | 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 |
p03078 | s058173302 | 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... | {"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":... | [] | ok | 407,746,987,648 | s014360762 | #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": 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 | 3.682957 | 3.682957 | [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 | 20.420021 | false | false | false | 3.699894 | 0.40751 | 0.110141 | 0.020439 | Accepted | Accepted | 0.020439 | 0.768254 | 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 |
p03078 | s176788640 | 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 {
... | {"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":... | [] | ok | 126,188,168,392 | s386168718 | #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": 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 | 1.124951 | 1.124951 | [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 | 6.31952 | false | false | false | 1.123953 | 0.125707 | 0.111843 | 0.020439 | Accepted | Accepted | 0.020439 | 0.131696 | 1 | 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 |
p03078 | s231332085 | 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 (... | {"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":... | [] | ok | 125,415,333,758 | s386168718 | #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": 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 | 1.118062 | 1.118062 | [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 | 6.280816 | false | false | false | 1.116402 | 0.124862 | 0.111843 | 0.020439 | Accepted | Accepted | 0.020439 | 0.124674 | 1 | 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 |
p03440 | s146893245 | 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... | {"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 | 376,696,235,058 | s524578974 | #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": 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 | 10.515504 | 10.439597 | [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 | 18.864996 | false | false | false | 16.505451 | 0.206108 | 0.012487 | 0.010832 | Accepted | Accepted | 0.010832 | 0.991521 | 7 | 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 |
p03440 | s161118872 | 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 -> ... | {"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 | 106,511,619,214 | s524578974 | #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": 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 | 2.973226 | 2.951817 | [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 | 5.334116 | false | false | false | 4.631421 | 0.057834 | 0.012487 | 0.010832 | Accepted | Accepted | 0.010832 | 0.964773 | 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 |
p03440 | s795701420 | 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){
... | {"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 | 149,033,148,264 | s287533378 | #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": 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 | 1.403074 | 1.403079 | [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 | 7.463599 | false | false | false | 1.398476 | 0.08113 | 0.058013 | 0.010832 | Accepted | Accepted | 0.010832 | 0.328839 | 2 | 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 |
p03440 | s059474458 | 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... | {"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":... | [] | ok | 374,176,313,368 | s287533378 | #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": 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 | 3.522687 | 3.522698 | [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 | 18.738798 | false | false | false | 3.523581 | 0.204415 | 0.058013 | 0.010832 | Accepted | Accepted | 0.010832 | 0.756271 | 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 |
p03440 | s791089970 | 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... | {"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":... | [] | ok | 578,382,465,518 | s281228417 | #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": 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 | 5.308472 | 5.308373 | [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 | 28.965468 | false | false | false | 5.338075 | 0.316479 | 0.059287 | 0.010832 | Accepted | Accepted | 0.010832 | 0.841466 | 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 | 28.692441 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s222562231 | 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 ... | {"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":... | [] | ok | 460,118,177,090 | s434800533 | #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": 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 | 22.699592 | 22.698096 | [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 | 23.042777 | false | false | false | 23.172197 | 0.251814 | 0.010867 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999852 | 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 |
p03440 | s641323479 | 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... | {"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 | 192,056,984,262 | s434800533 | #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": 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 | 9.475028 | 9.474366 | [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 | 9.618238 | false | false | false | 9.622602 | 0.10457 | 0.010867 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999621 | 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 |
p03440 | s930344679 | 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])... | {"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":... | [] | ok | 675,268,453,860 | s299005074 | #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": 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 | 1.841947 | 1.84195 | [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 | 33.817531 | false | false | false | 1.841862 | 0.369361 | 0.200537 | 0.010832 | Accepted | Accepted | 0.010832 | 0.47088 | 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 | 33.498664 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s943257023 | 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... | {"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":... | [] | ok | 376,289,250,480 | s810598254 | # 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": 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 | 1.220553 | 1.217668 | [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 | 18.844614 | false | false | false | 1.524114 | 0.205759 | 0.135002 | 0.010832 | Accepted | Accepted | 0.010832 | 0.36299 | 2 | 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 |
p03440 | s470796503 | 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... | {"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":... | [] | ok | 379,904,893,082 | s810598254 | # 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": 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 | 1.232277 | 1.229368 | [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 | 19.025686 | false | false | false | 1.539358 | 0.207817 | 0.135002 | 0.010832 | Accepted | Accepted | 0.010832 | 0.369645 | 2 | 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 |
p03440 | s609138685 | 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... | {"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":... | [] | ok | 379,908,303,632 | s810598254 | # 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": 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 | 1.232288 | 1.229379 | [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 | 19.025857 | false | false | false | 1.539004 | 0.207769 | 0.135002 | 0.010832 | Accepted | Accepted | 0.010832 | 0.369491 | 2 | 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 |
p03440 | s421502011 | 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<... | {"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":... | [] | ok | 377,523,095,664 | s550905759 | // #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": 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 | 3.46283 | 3.46287 | [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 | 18.906405 | false | false | false | 3.48154 | 0.206326 | 0.059263 | 0.010832 | Accepted | Accepted | 0.010832 | 0.752262 | 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.728177 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s217738469 | 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... | {"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":... | [] | ok | 376,594,761,686 | s196530533 | #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": 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 | 2.3665 | 2.366473 | [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 | 18.859914 | false | false | false | 2.36858 | 0.206148 | 0.087035 | 0.010832 | Accepted | Accepted | 0.010832 | 0.609849 | 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.682148 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s674667124 | 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... | {"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":... | [] | ok | 673,004,531,056 | s687836785 | #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": 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 | 33.386526 | 33.383399 | [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 | 33.704153 | false | false | false | 34.012738 | 0.36841 | 0.010832 | 0.010832 | Accepted | Accepted | 0.010832 | 1 | 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 |
p03440 | s761681421 | 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;
... | {"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 | 452,531,685,606 | s687836785 | #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": 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 | 22.449203 | 22.447168 | [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 | 22.662845 | false | false | false | 22.848058 | 0.247479 | 0.010832 | 0.010832 | Accepted | Accepted | 0.010832 | 1 | 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 |
p03440 | s320126379 | 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... | {"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 | 376,696,235,058 | s687836785 | #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": 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 | 18.687187 | 18.685462 | [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 | 18.864996 | false | false | false | 19.02857 | 0.206108 | 0.010832 | 0.010832 | Accepted | Accepted | 0.010832 | 1 | 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 |
p03440 | s161991354 | 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... | {"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 | 375,894,022,218 | s687836785 | #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": 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 | 18.647129 | 18.645669 | [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 | 18.824821 | false | false | false | 18.962587 | 0.205394 | 0.010832 | 0.010832 | Accepted | Accepted | 0.010832 | 1 | 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 |
p03440 | s134276380 | 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... | {"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 | 366,521,704,120 | s687836785 | #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": 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 | 18.182281 | 18.180769 | [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 | 18.355454 | false | false | false | 18.485993 | 0.200231 | 0.010832 | 0.010832 | Accepted | Accepted | 0.010832 | 1 | 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 |
p03440 | s836320341 | train | cpp | #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": 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 | 268,403,498,220 | s889759872 | #include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int p[100100];
ll ans;
int n, m;
pair<ll, int> a[100100];
bool group_used[100100];
bool used[100100];
int root(int x) { return x == p[x] ? x : p[x] = root(p[x]); }
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ... | {"0": 198937882, "1": 194001808, "2": 196311830, "3": 198864666, "4": 198985072, "5": 196726530, "6": 196726530, "7": 196679340, "8": 196662466, "9": 196665040, "10": 196660178, "11": 196679340, "12": 196726530, "13": 196726530, "14": 196726530, "15": 196726530, "16": 196726530, "17": 196726530, "18": 196570946, "19": ... | ok | 13.182936 | 13.182479 | [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 | 13.441682 | false | false | false | 13.421937 | 0.146476 | 0.010913 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999398 | 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 | 13.314953 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s850918614 | train | cpp | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#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<<1)+c-'0');
return f?-x:x;
... | {"0": 2586497914, "1": 2579528666, "2": 2578909762, "3": 2586571416, "4": 2586559976, "5": 2581841548, "6": 2581841548, "7": 2581641062, "8": 2581641062, "9": 2582142992, "10": 2581758036, "11": 2581641062, "12": 2581864142, "13": 2581864142, "14": 2581864142, "15": 2581864142, "16": 2581864142, "17": 2581864142, "18":... | [] | ok | 268,374,009,904 | s889759872 | #include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int p[100100];
ll ans;
int n, m;
pair<ll, int> a[100100];
bool group_used[100100];
bool used[100100];
int root(int x) { return x == p[x] ? x : p[x] = root(p[x]); }
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ... | {"0": 198937882, "1": 194001808, "2": 196311830, "3": 198864666, "4": 198985072, "5": 196726530, "6": 196726530, "7": 196679340, "8": 196662466, "9": 196665040, "10": 196660178, "11": 196679340, "12": 196726530, "13": 196726530, "14": 196726530, "15": 196726530, "16": 196726530, "17": 196726530, "18": 196570946, "19": ... | ok | 13.181471 | 13.181031 | [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 | 13.440205 | false | false | false | 13.42154 | 0.146472 | 0.010913 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999398 | 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 | 13.313473 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s597042545 | train | cpp | #include<bits/stdc++.h>
#define rep(i,a,b) for (int i=(a); i<=(b); i++)
#define per(i,a,b) for (int i=(a); i>=(b); i--)
using namespace std;
const int maxn = 100005;
int a[maxn], vis[maxn], n, m, x, y, mn, cur;
priority_queue<int, vector<int>, greater<int> > Q;
vector<int> e[maxn];
long long ans;
void dfs(... | {"0": 3617524482, "1": 3596932482, "2": 3596961082, "3": 3617625726, "4": 3617511898, "5": 3609537932, "6": 3609537932, "7": 3609513908, "8": 3608975370, "9": 3609419242, "10": 3608867548, "11": 3609513908, "12": 3609487596, "13": 3609487596, "14": 3609487596, "15": 3609419242, "16": 3609487596, "17": 3609419242, "18":... | [] | ok | 374,618,276,032 | s889759872 | #include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int p[100100];
ll ans;
int n, m;
pair<ll, int> a[100100];
bool group_used[100100];
bool used[100100];
int root(int x) { return x == p[x] ? x : p[x] = root(p[x]); }
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ... | {"0": 198937882, "1": 194001808, "2": 196311830, "3": 198864666, "4": 198985072, "5": 196726530, "6": 196726530, "7": 196679340, "8": 196662466, "9": 196665040, "10": 196660178, "11": 196679340, "12": 196726530, "13": 196726530, "14": 196726530, "15": 196726530, "16": 196726530, "17": 196726530, "18": 196570946, "19": ... | ok | 18.399511 | 18.399155 | [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 | 18.760931 | false | false | false | 18.762359 | 0.204758 | 0.010913 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999579 | 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.583768 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s420254577 | train | cpp | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<queue>
#include<vector>
#include<map>
using namespace std;
#define llg long long
#define maxn 200010
#define yyj(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);
inline llg getint... | {"0": 1021950930, "1": 1016720276, "2": 1021380074, "3": 1022116238, "4": 1021950930, "5": 1021702968, "6": 1021702968, "7": 1021702968, "8": 1021702968, "9": 1021718412, "10": 1021702968, "11": 1021702968, "12": 1021702968, "13": 1021702968, "14": 1021702968, "15": 1021702968, "16": 1021702968, "17": 1021702968, "18":... | [] | ok | 106,082,644,954 | s889759872 | #include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int p[100100];
ll ans;
int n, m;
pair<ll, int> a[100100];
bool group_used[100100];
bool used[100100];
int root(int x) { return x == p[x] ? x : p[x] = root(p[x]); }
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ... | {"0": 198937882, "1": 194001808, "2": 196311830, "3": 198864666, "4": 198985072, "5": 196726530, "6": 196726530, "7": 196679340, "8": 196662466, "9": 196665040, "10": 196660178, "11": 196679340, "12": 196726530, "13": 196726530, "14": 196726530, "15": 196726530, "16": 196726530, "17": 196726530, "18": 196570946, "19": ... | ok | 5.210309 | 5.210186 | [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 | 5.312632 | false | false | false | 5.290604 | 0.057737 | 0.010913 | 0.010832 | Accepted | Accepted | 0.010832 | 0.998258 | 9 | 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.262486 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s936324892 | train | cpp | #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": 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 | 106,218,672,846 | s889759872 | #include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int p[100100];
ll ans;
int n, m;
pair<ll, int> a[100100];
bool group_used[100100];
bool used[100100];
int root(int x) { return x == p[x] ? x : p[x] = root(p[x]); }
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ... | {"0": 198937882, "1": 194001808, "2": 196311830, "3": 198864666, "4": 198985072, "5": 196726530, "6": 196726530, "7": 196679340, "8": 196662466, "9": 196665040, "10": 196660178, "11": 196679340, "12": 196726530, "13": 196726530, "14": 196726530, "15": 196726530, "16": 196726530, "17": 196726530, "18": 196570946, "19": ... | ok | 5.217027 | 5.216867 | [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 | 5.319445 | false | false | false | 5.315878 | 0.058013 | 0.010913 | 0.010832 | Accepted | Accepted | 0.010832 | 0.998269 | 9 | 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.269271 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s080959208 | train | cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sd(x) scanf("%d", &(x))
#define pii pair<int, int>
#define F first
#define S second
#define all(c) ((c).begin()), ((c).end())
#define sz(x) ((int)(x).size())
#define ld long double
template<class T,class U>
ostream& operator<<(ost... | {"0": 1027113516, "1": 1021426120, "2": 1018681950, "3": 1026876136, "4": 1026953642, "5": 1022713692, "6": 1022713692, "7": 1022703968, "8": 1022713406, "9": 1022705684, "10": 1022705684, "11": 1022703968, "12": 1022689668, "13": 1022689668, "14": 1022689668, "15": 1022705684, "16": 1022689668, "17": 1022705684, "18":... | [] | ok | 106,221,123,008 | s889759872 | #include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int p[100100];
ll ans;
int n, m;
pair<ll, int> a[100100];
bool group_used[100100];
bool used[100100];
int root(int x) { return x == p[x] ? x : p[x] = root(p[x]); }
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ... | {"0": 198937882, "1": 194001808, "2": 196311830, "3": 198864666, "4": 198985072, "5": 196726530, "6": 196726530, "7": 196679340, "8": 196662466, "9": 196665040, "10": 196660178, "11": 196679340, "12": 196726530, "13": 196726530, "14": 196726530, "15": 196726530, "16": 196726530, "17": 196726530, "18": 196570946, "19": ... | ok | 5.217126 | 5.216988 | [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 | 5.319567 | false | false | false | 5.312762 | 0.057979 | 0.010913 | 0.010832 | Accepted | Accepted | 0.010832 | 0.998267 | 9 | 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.269372 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s976535597 | train | cpp | #include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, ar... | {"0": 9546023916, "1": 9535869486, "2": 9534409456, "3": 9545279172, "4": 9545184506, "5": 9535881498, "6": 9535881498, "7": 9534428332, "8": 9533160494, "9": 9534130892, "10": 9533962438, "11": 9534428332, "12": 9534525286, "13": 9534525286, "14": 9534525286, "15": 9534676008, "16": 9534525286, "17": 9534676008, "18":... | [] | ok | 991,713,527,662 | s026327219 | #include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, ar... | {"0": 6572979270, "1": 6563480352, "2": 6563963978, "3": 6574594598, "4": 6573389966, "5": 6565129428, "6": 6565129428, "7": 6564286872, "8": 6563399414, "9": 6563414286, "10": 6563474632, "11": 6564286872, "12": 6563176620, "13": 6563176620, "14": 6563176620, "15": 6565186628, "16": 6563176620, "17": 6565186628, "18":... | ok | 1.452551 | 1.45255 | [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 | 49.665141 | false | false | false | 1.452941 | 0.543145 | 0.373824 | 0.010832 | Accepted | Accepted | 0.010832 | 0.318084 | 2 | 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 | 49.197197 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s878620271 | train | cpp | //左手拈着花，右手舞着剑
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstring>
#include<map>
#include<vector>
#include<queue>
#define ll long long
#define pi pair<int,int>
#define mp(a,b) make_pair(a,b)
using namespace std;
const int N=100005;priority_queue
<pi,vector<pi>,great... | {"0": 4455315150, "1": 4437325750, "2": 4435741310, "3": 4456107370, "4": 4455566830, "5": 4452824376, "6": 4452824376, "7": 4452314724, "8": 4452797492, "9": 4452804642, "10": 4452640192, "11": 4452120816, "12": 4453052032, "13": 4453160426, "14": 4453042022, "15": 4452607874, "16": 4452903026, "17": 4452607874, "18":... | [] | ok | 462,060,578,694 | s859413836 | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define N 100005
#define int long long
using namespace std;
#define v1 first
#define v2 second
#define pb push_back
#define mid ((l+r)>>1)
#define vec vector<int>
#define pr pair<int,int>
#define tp tuple<int,int,int>
#define sz(x) ((int) x.size())
#define ... | {"0": 1021798492, "1": 1015980108, "2": 1017886298, "3": 1021600866, "4": 1021598864, "5": 1017888300, "6": 1017888300, "7": 1017888300, "8": 1017888300, "9": 1017832244, "10": 1017887728, "11": 1017888300, "12": 1017828240, "13": 1017828240, "14": 1017828240, "15": 1017828240, "16": 1017828240, "17": 1017828240, "18":... | ok | 4.366386 | 4.366472 | [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 | 23.140053 | false | false | false | 4.382757 | 0.252403 | 0.05759 | 0.010832 | Accepted | Accepted | 0.010832 | 0.80644 | 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.921477 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s357892261 | train | cpp | #include<cstdio>
#include<set>
#include<algorithm>
using namespace std;
const int MAXN = 100000;
struct node{
int num, key, vis;
};
node a[MAXN + 5];
bool operator < (node a, node b) {
return a.key < b.key;
}
set<node>Set[MAXN + 5];
int fa[MAXN + 5];
int Find(int x) {
if( fa[x] == x ) return x;
retu... | {"0": 6395830870, "1": 6386232996, "2": 6389238284, "3": 6394699740, "4": 6395818572, "5": 6391365266, "6": 6391365266, "7": 6391894366, "8": 6391643258, "9": 6390235566, "10": 6391632104, "11": 6391894366, "12": 6391755942, "13": 6391755942, "14": 6391755942, "15": 6392643686, "16": 6391755942, "17": 6392643686, "18":... | [] | ok | 664,470,132,612 | s347492742 | #include <iostream>
#include<cstdio>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
int a[100005],fa[100005],vis[100005],mi[100005];
priority_queue<pair<int,int>, vector<pair<int,... | {"0": 1024840960, "1": 1021527078, "2": 1019126966, "3": 1024856118, "4": 1025069760, "5": 1022728850, "6": 1022728850, "7": 1022433412, "8": 1022433412, "9": 1022642192, "10": 1022441992, "11": 1022433412, "12": 1022710546, "13": 1022710546, "14": 1022710546, "15": 1022642192, "16": 1022710546, "17": 1022642192, "18":... | ok | 6.255337 | 6.255269 | [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 | 33.276749 | false | false | false | 6.3304 | 0.363857 | 0.057478 | 0.010832 | Accepted | Accepted | 0.010832 | 0.867867 | 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 | 32.963142 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s005320316 | train | cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=100010;
multiset<int> S[maxn];
set<pair<int,int> > S2;
struct Edge
{
int v,next;
} e[maxn<<1];
int g[maxn],tot;
void addedge(int x,int y)
{
tot++;
e[tot].v=y;
e[tot].next=g[x];
g[x]=tot;
}
int n,m;
bool vis[maxn]... | {"0": 6471203882, "1": 6469566246, "2": 6469696662, "3": 6475543360, "4": 6476416518, "5": 6470809774, "6": 6470809774, "7": 6471066602, "8": 6469175570, "9": 6469035716, "10": 6471066602, "11": 6471066602, "12": 6472035284, "13": 6472035284, "14": 6472035284, "15": 6470794044, "16": 6472035284, "17": 6470794044, "18":... | [] | ok | 672,928,881,482 | s347492742 | #include <iostream>
#include<cstdio>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
int a[100005],fa[100005],vis[100005],mi[100005];
priority_queue<pair<int,int>, vector<pair<int,... | {"0": 1024840960, "1": 1021527078, "2": 1019126966, "3": 1024856118, "4": 1025069760, "5": 1022728850, "6": 1022728850, "7": 1022433412, "8": 1022433412, "9": 1022642192, "10": 1022441992, "11": 1022433412, "12": 1022710546, "13": 1022710546, "14": 1022710546, "15": 1022642192, "16": 1022710546, "17": 1022642192, "18":... | ok | 6.33497 | 6.334899 | [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 | 33.700365 | false | false | false | 6.414638 | 0.368699 | 0.057478 | 0.010832 | Accepted | Accepted | 0.010832 | 0.869655 | 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 | 33.38278 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s071276583 | train | cpp | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#define SF scanf
#define PF printf
#define MAXN 100010
using namespace std;
int n,m,sum;
vector<int> a[MAXN];
bool vis[MAXN],used[MAXN];
int val[MAXN],b[MAXN];
long long ans;
int dfs(int x){
vis[x]=1;
int idx... | {"0": 3534570468, "1": 3524059682, "2": 3522804428, "3": 3534617372, "4": 3534410308, "5": 3526638258, "6": 3526638258, "7": 3526466658, "8": 3526511846, "9": 3526368560, "10": 3526533296, "11": 3526466658, "12": 3526399448, "13": 3526399448, "14": 3526399448, "15": 3526521570, "16": 3526399448, "17": 3526521570, "18":... | [] | ok | 366,605,920,252 | s347492742 | #include <iostream>
#include<cstdio>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
int a[100005],fa[100005],vis[100005],mi[100005];
priority_queue<pair<int,int>, vector<pair<int,... | {"0": 1024840960, "1": 1021527078, "2": 1019126966, "3": 1024856118, "4": 1025069760, "5": 1022728850, "6": 1022728850, "7": 1022433412, "8": 1022433412, "9": 1022642192, "10": 1022441992, "11": 1022433412, "12": 1022710546, "13": 1022710546, "14": 1022710546, "15": 1022642192, "16": 1022710546, "17": 1022642192, "18":... | ok | 3.451225 | 3.451199 | [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 | 18.359671 | false | false | false | 3.48723 | 0.200438 | 0.057478 | 0.010832 | Accepted | Accepted | 0.010832 | 0.753984 | 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.186587 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s079267723 | train | cpp | #include <bits/stdc++.h>
using namespace std;
int n, m;
int a[100005];
struct Union_Find_Set {
int fa[100005];
void Init() {
for (int i = 1; i <= n; i++) {
fa[i] = i;
}
}
int Find(int x) {
if (fa[x] != x) fa[x] = Find(fa[x]);
return fa[x];
}
void Union(int x, int y) {
fa[Find(x)] = Fi... | {"0": 3609032570, "1": 3599050312, "2": 3598326160, "3": 3608712250, "4": 3608776886, "5": 3605519346, "6": 3605519346, "7": 3605412382, "8": 3605412382, "9": 3605412382, "10": 3605333446, "11": 3605412382, "12": 3605338308, "13": 3605338308, "14": 3605338308, "15": 3605412382, "16": 3605338308, "17": 3605412382, "18":... | [] | ok | 374,550,213,466 | s347492742 | #include <iostream>
#include<cstdio>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
int a[100005],fa[100005],vis[100005],mi[100005];
priority_queue<pair<int,int>, vector<pair<int,... | {"0": 1024840960, "1": 1021527078, "2": 1019126966, "3": 1024856118, "4": 1025069760, "5": 1022728850, "6": 1022728850, "7": 1022433412, "8": 1022433412, "9": 1022642192, "10": 1022441992, "11": 1022433412, "12": 1022710546, "13": 1022710546, "14": 1022710546, "15": 1022642192, "16": 1022710546, "17": 1022642192, "18":... | ok | 3.525991 | 3.525986 | [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 | 18.757523 | false | false | false | 3.561173 | 0.204688 | 0.057478 | 0.010832 | Accepted | Accepted | 0.010832 | 0.759378 | 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.580571 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s915390688 | train | cpp | #include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int a[100001],f[100001];
int ff(int u){
return f[u]==u?u:f[u]=ff(f[u]);
}
vector<int>g[100001];
int c[100001];
int main(){
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]),
f[i]=i;
for(int i=1;i<=m... | {"0": 3534102572, "1": 3528522140, "2": 3526889652, "3": 3534047374, "4": 3533725624, "5": 3530847034, "6": 3530847034, "7": 3530748364, "8": 3530601646, "9": 3530903662, "10": 3530592494, "11": 3530748364, "12": 3530967726, "13": 3530967726, "14": 3530967726, "15": 3530746076, "16": 3530967726, "17": 3530746076, "18":... | [] | ok | 367,020,927,702 | s347492742 | #include <iostream>
#include<cstdio>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
int a[100005],fa[100005],vis[100005],mi[100005];
priority_queue<pair<int,int>, vector<pair<int,... | {"0": 1024840960, "1": 1021527078, "2": 1019126966, "3": 1024856118, "4": 1025069760, "5": 1022728850, "6": 1022728850, "7": 1022433412, "8": 1022433412, "9": 1022642192, "10": 1022441992, "11": 1022433412, "12": 1022710546, "13": 1022710546, "14": 1022710546, "15": 1022642192, "16": 1022710546, "17": 1022642192, "18":... | ok | 3.455129 | 3.455106 | [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 | 18.380455 | false | false | false | 3.49052 | 0.200627 | 0.057478 | 0.010832 | Accepted | Accepted | 0.010832 | 0.754229 | 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.207161 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s579533980 | 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;
... | {"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 | 452,531,685,606 | s347492742 | #include <iostream>
#include<cstdio>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
int a[100005],fa[100005],vis[100005],mi[100005];
priority_queue<pair<int,int>, vector<pair<int,... | {"0": 1024840960, "1": 1021527078, "2": 1019126966, "3": 1024856118, "4": 1025069760, "5": 1022728850, "6": 1022728850, "7": 1022433412, "8": 1022433412, "9": 1022642192, "10": 1022441992, "11": 1022433412, "12": 1022710546, "13": 1022710546, "14": 1022710546, "15": 1022642192, "16": 1022710546, "17": 1022642192, "18":... | ok | 4.260132 | 4.260098 | [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 | 22.662845 | false | false | false | 4.305652 | 0.247479 | 0.057478 | 0.010832 | Accepted | Accepted | 0.010832 | 0.802887 | 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.449203 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s982461164 | train | cpp | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+100;
typedef long long LL;
int val[maxn],First[maxn],cnt,N,M;
int tot,pre[maxn];
LL ans = 0;
struct node{
int to,Next;
}Tree[maxn*2];
void init(){
memset(First,-1,sizeof(First));
cnt = 0;
}
void addedge(int from,int to){
T... | {"0": 4939357566, "1": 4935874944, "2": 4934550764, "3": 4939010362, "4": 4939431640, "5": 4938460956, "6": 4938460956, "7": 4938458668, "8": 4937748816, "9": 4937422490, "10": 4937046400, "11": 4938458668, "12": 4937453092, "13": 4937453092, "14": 4937841766, "15": 4934995494, "16": 4937453092, "17": 4934995494, "18":... | [] | ok | 513,295,574,792 | s347492742 | #include <iostream>
#include<cstdio>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
int a[100005],fa[100005],vis[100005],mi[100005];
priority_queue<pair<int,int>, vector<pair<int,... | {"0": 1024840960, "1": 1021527078, "2": 1019126966, "3": 1024856118, "4": 1025069760, "5": 1022728850, "6": 1022728850, "7": 1022433412, "8": 1022433412, "9": 1022642192, "10": 1022441992, "11": 1022433412, "12": 1022710546, "13": 1022710546, "14": 1022710546, "15": 1022642192, "16": 1022710546, "17": 1022642192, "18":... | ok | 4.83216 | 4.832124 | [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 | 25.705908 | false | false | false | 4.885706 | 0.280819 | 0.057478 | 0.010832 | Accepted | Accepted | 0.010832 | 0.827228 | 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 | 25.463565 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s714585116 | train | cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
long long a[N];
vector <int> ad[N];
int n, m;
int cnt;
bool mrk[N];
set < pair<long long, int> > s[N];
set < pair<long long, int> > can;
void dfs(int v) {
mrk[v] = 1;
s[cnt].insert({a[v], v});
for (auto u: ad[v]) {
if (!mrk[u])
... | {"0": 9486798178, "1": 9473411090, "2": 9476714390, "3": 9486798750, "4": 9484890272, "5": 9479456558, "6": 9479456558, "7": 9475234626, "8": 9476651184, "9": 9480861390, "10": 9476705238, "11": 9475234626, "12": 9476612574, "13": 9476612574, "14": 9476612574, "15": 9477895284, "16": 9476612574, "17": 9477895284, "18":... | [] | ok | 985,629,983,338 | s052647468 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int a[N], mark[N];
vector<int> adj[N], v[N];
void dfs(int root, int col) {
mark[root] = col;
for (int i = 0; i < adj[root].size(); i++) {
int u = adj[root][i];
if (!mark[u])
df... | {"0": 6593055326, "1": 6577448592, "2": 6590450724, "3": 6593326740, "4": 6591928486, "5": 6593337036, "6": 6593337036, "7": 6591983970, "8": 6591237796, "9": 6592280266, "10": 6591962234, "11": 6591983970, "12": 6591501774, "13": 6591501774, "14": 6591501774, "15": 6591794638, "16": 6591501774, "17": 6591794638, "18":... | ok | 1.438867 | 1.438854 | [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 | 49.360476 | false | false | false | 1.438086 | 0.539548 | 0.375185 | 0.010832 | Accepted | Accepted | 0.010832 | 0.310872 | 2 | 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 | 48.895302 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s132640792 | train | cpp | //IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
const int MAXSU = 1000 * 1000 + 17;
struct DSU {
int par[MAXSU];
DSU () {
memset(par, -1, sizeof(par));
}
int find_root(int x) {
... | {"0": 11042919316, "1": 11039431832, "2": 11034638186, "3": 11041083482, "4": 11044988240, "5": 11039817932, "6": 11039817932, "7": 11036876136, "8": 11036870416, "9": 11037098072, "10": 11039043444, "11": 11036876136, "12": 11038474590, "13": 11038474590, "14": 11038474590, "15": 11038474590, "16": 11038474590, "17": ... | [] | ok | 1,147,964,629,526 | s052647468 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int a[N], mark[N];
vector<int> adj[N], v[N];
void dfs(int root, int col) {
mark[root] = col;
for (int i = 0; i < adj[root].size(); i++) {
int u = adj[root][i];
if (!mark[u])
df... | {"0": 6593055326, "1": 6577448592, "2": 6590450724, "3": 6593326740, "4": 6591928486, "5": 6593337036, "6": 6593337036, "7": 6591983970, "8": 6591237796, "9": 6592280266, "10": 6591962234, "11": 6591983970, "12": 6591501774, "13": 6591501774, "14": 6591501774, "15": 6591794638, "16": 6591501774, "17": 6591794638, "18":... | ok | 1.675851 | 1.675836 | [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 | 57.490216 | false | false | false | 1.674981 | 0.628428 | 0.375185 | 0.010832 | Accepted | Accepted | 0.010832 | 0.410046 | 2 | 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 | 56.948461 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s178741223 | train | cpp | #include<bits/stdc++.h>
using namespace std;
vector <long long> l,q[100005];
long long n,m,x,y,ans,tot,w[100005],f[100005],cnt[100005];
long long find(long long x)
{
return f[x]==x?f[x]:f[x]=find(f[x]);
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
f[i]=i;
cin>>w[i];
}
for(int i=1;i<=m;i++... | {"0": 3626699934, "1": 3621435532, "2": 3621694362, "3": 3626830922, "4": 3626592112, "5": 3622608704, "6": 3622608704, "7": 3621449546, "8": 3621240194, "9": 3622476286, "10": 3621240194, "11": 3621449546, "12": 3621589972, "13": 3621589972, "14": 3621589972, "15": 3621745270, "16": 3621589972, "17": 3621745270, "18":... | [] | ok | 376,695,336,446 | s466831959 | #include<bits/stdc++.h>
#define ri register int
using namespace std;
int n,m,a[100005],f[100005],b[100005],t,c;
long long ans;
inline int read()
{
char ch=getchar();int x=0,f=1;while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();return x*f;
}
inli... | {"0": 1008536958, "1": 1004862716, "2": 1004862716, "3": 1008490912, "4": 1008529236, "5": 1007712706, "6": 1007712706, "7": 1007712706, "8": 1007712706, "9": 1007717568, "10": 1007712706, "11": 1007712706, "12": 1007712706, "13": 1007712706, "14": 1007712706, "15": 1007712706, "16": 1007712706, "17": 1007712706, "18":... | ok | 3.600406 | 3.600351 | [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 | 18.864951 | false | false | false | 3.615759 | 0.206033 | 0.056982 | 0.010832 | Accepted | Accepted | 0.010832 | 0.763575 | 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.687161 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s365778840 | train | cpp | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const long long MAXN=100005;
namespace DSU
{
long long fa[MAXN];
void Clear()
{memset(fa,-1,sizeof fa);}
long long Root(long long x)
{return fa[x]==-1?x:(fa[x]=Root(fa[x]));}
void Union(long long x,long long y)
{
long l... | {"0": 4293939936, "1": 4288017448, "2": 4286885460, "3": 4294131842, "4": 4293914768, "5": 4290714428, "6": 4290714428, "7": 4290823966, "8": 4290934076, "9": 4290859430, "10": 4290823966, "11": 4290823966, "12": 4290823966, "13": 4290823966, "14": 4290823966, "15": 4290823966, "16": 4290823966, "17": 4290823966, "18":... | [] | ok | 446,032,201,758 | s382973207 | #include<cstdio>
#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(int x)
{
if(fa[x]=... | {"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 | 22.004826 | 22.003221 | [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 | 22.33735 | false | false | false | 22.433256 | 0.243784 | 0.010867 | 0.010832 | Accepted | Accepted | 0.010832 | 0.999847 | 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.126746 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s633132487 | train | cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 100 * 1000 + 5;
int nparts = 0;
int a[N];
vector <int> adj[N];
int part[N];
vector <int> vec[N];
vector <int> rm;
void dfs(int v) {
for (auto u : adj[v]) {
if (!part[u]) {
part[u] = part[v];
dfs(u... | {"0": 6610605144, "1": 6611016126, "2": 6597679946, "3": 6610110650, "4": 6611874126, "5": 6612501038, "6": 6612501038, "7": 6611615868, "8": 6611278102, "9": 6612501038, "10": 6611546942, "11": 6611615868, "12": 6611810634, "13": 6611810634, "14": 6611810634, "15": 6612018842, "16": 6611810634, "17": 6612018842, "18":... | [] | ok | 687,217,124,022 | s075582939 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
bool vis[MAXN];
int n, m, k;
int u, v;
int a[MAXN];
long long ans;
vector<int> adj[MAXN];
vector<int> ret;
vector<vector<int>> b;
void dfs(int x, vector<int>& k) {
k.push_back(a[x]);
vis[x] = true;
for (int u: adj[x])
i... | {"0": 3656715062, "1": 3647476118, "2": 3652141350, "3": 3656676738, "4": 3656866642, "5": 3653398892, "6": 3653398892, "7": 3652514008, "8": 3652514008, "9": 3653407758, "10": 3652435644, "11": 3652514008, "12": 3652399322, "13": 3652399322, "14": 3652399322, "15": 3652508860, "16": 3652399322, "17": 3652508860, "18":... | ok | 1.809854 | 1.809852 | [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 | 34.415922 | false | false | false | 1.810582 | 0.375819 | 0.207568 | 0.010832 | Accepted | Accepted | 0.010832 | 0.460977 | 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 | 34.091403 | null | null | null | null | null | null | null | null | null | null | null |
p03440 | s762738173 | train | cpp | //#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<bitset>
#include<list>
#include<cassert>
#include<numeric>
#include<iomanip>
using namespace std;
const long long N ... | {"0": 6561591036, "1": 6559162038, "2": 6548715316, "3": 6560212802, "4": 6561081670, "5": 6558926660, "6": 6558926660, "7": 6558337786, "8": 6558816550, "9": 6559501806, "10": 6558092112, "11": 6558337786, "12": 6557661968, "13": 6557661968, "14": 6557661968, "15": 6558012890, "16": 6557661968, "17": 6558012890, "18":... | [] | ok | 681,812,800,240 | s075582939 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
bool vis[MAXN];
int n, m, k;
int u, v;
int a[MAXN];
long long ans;
vector<int> adj[MAXN];
vector<int> ret;
vector<vector<int>> b;
void dfs(int x, vector<int>& k) {
k.push_back(a[x]);
vis[x] = true;
for (int u: adj[x])
i... | {"0": 3656715062, "1": 3647476118, "2": 3652141350, "3": 3656676738, "4": 3656866642, "5": 3653398892, "6": 3653398892, "7": 3652514008, "8": 3652514008, "9": 3653407758, "10": 3652435644, "11": 3652514008, "12": 3652399322, "13": 3652399322, "14": 3652399322, "15": 3652508860, "16": 3652399322, "17": 3652508860, "18":... | ok | 1.795625 | 1.795619 | [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 | 34.145272 | false | false | false | 1.798105 | 0.373229 | 0.207568 | 0.010832 | Accepted | Accepted | 0.010832 | 0.457125 | 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 | 33.823385 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s332008653 | train | cpp | #include <iostream>
#include <algorithm>
#include <vector>
#define fs first
#define sc second
using namespace std;
const int maxn = 1e5+10;
using pii = pair<int,int>;
int N;
int main(){
cin>>N;
cout<<(N+2-1)/2<<endl;
return 0;
} | {"0": 1021715552, "1": 1021715552, "2": 1021715552, "3": 1021715552, "4": 1021715552, "5": 1021715552, "6": 1021715552, "7": 1021715552, "8": 1021715552, "9": 1021715552, "10": 1021715552, "11": 1021715552, "12": 1021715552, "13": 1021715552, "14": 1021715552, "15": 1021715552, "16": 1021715552, "17": 1021715552, "18":... | [] | ok | 106,258,710,844 | s840358178 | #include <stdio.h>
int main()
{
int N;
scanf("%d", &N);
if(N%2==0)
{
printf("%d", N/2);
}
else if(N%2!=0)
{
printf("%d", N/2 + 1);
}
return 0;
} | {"0": 193718668, "1": 193734684, "2": 193718668, "3": 193713806, "4": 193731538, "5": 193656034, "6": 193731538, "7": 193718668, "8": 193656034, "9": 193652888, "10": 193652888, "11": 193713806, "12": 193737830, "13": 193737830, "14": 193737830, "15": 193731538, "16": 193737830, "17": 193737830, "18": 193731538, "19": ... | ok | 5.273848 | 5.273848 | [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 | 5.32145 | false | false | false | 5.315087 | 0.105369 | 0.019825 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998549 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.27416 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s042151861 | train | cpp | #include<bits/stdc++.h>
using namespace std;
main()
{
int n;
cin>>n;
if(n%2==0)
{
cout<<""<<n/2;
}
else
{
cout<<""<<(n/2)+1;
}
}
| {"0": 1019887440, "1": 1019894876, "2": 1019887440, "3": 1019911464, "4": 1019908318, "5": 1019869708, "6": 1019908318, "7": 1019887440, "8": 1019869708, "9": 1019880290, "10": 1019880290, "11": 1019911464, "12": 1019908032, "13": 1019908032, "14": 1019908032, "15": 1019899452, "16": 1019908032, "17": 1019908032, "18":... | [] | ok | 106,070,299,192 | s840358178 | #include <stdio.h>
int main()
{
int N;
scanf("%d", &N);
if(N%2==0)
{
printf("%d", N/2);
}
else if(N%2!=0)
{
printf("%d", N/2 + 1);
}
return 0;
} | {"0": 193718668, "1": 193734684, "2": 193718668, "3": 193713806, "4": 193731538, "5": 193656034, "6": 193731538, "7": 193718668, "8": 193656034, "9": 193652888, "10": 193652888, "11": 193713806, "12": 193737830, "13": 193737830, "14": 193737830, "15": 193731538, "16": 193737830, "17": 193737830, "18": 193731538, "19": ... | ok | 5.264497 | 5.264497 | [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 | 5.312014 | false | false | false | 5.323184 | 0.10553 | 0.019825 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998551 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.264808 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s466383479 | train | cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin>> n;
cout<< (n + 1) / 2;
return 0;
}
| {"0": 1019752448, "1": 1019754164, "2": 1019752448, "3": 1019767320, "4": 1019754164, "5": 1019752448, "6": 1019754164, "7": 1019752448, "8": 1019752448, "9": 1019767320, "10": 1019767320, "11": 1019767320, "12": 1019760170, "13": 1019760170, "14": 1019760170, "15": 1019760170, "16": 1019760170, "17": 1019760170, "18":... | [] | ok | 106,055,096,576 | s044261625 | #include<stdio.h>
int main()
{
int N;
int O;
int Z;
scanf("%d",&N);
if(N%2!=0){
printf("%d",N/2+1);
}
else if(N%2==0)
printf("%d",N/2);
return 0;
} | {"0": 193656034, "1": 193731538, "2": 193656034, "3": 193652888, "4": 193734684, "5": 193718668, "6": 193734684, "7": 193656034, "8": 193718668, "9": 193713806, "10": 193713806, "11": 193652888, "12": 193731538, "13": 193731538, "14": 193731538, "15": 193737830, "16": 193731538, "17": 193731538, "18": 193737830, "19": ... | ok | 5.26377 | 5.26377 | [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 | 5.311253 | false | false | false | 5.304996 | 0.105169 | 0.019825 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998545 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.264054 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s868307170 | train | cpp | #include<bits/stdc++.h>
using namespace std ;
int main(){
long long a;
cin>>a;
cout<<(a+1)/2<<endl;
} | {"0": 1021038590, "1": 1021042880, "2": 1021038590, "3": 1021045168, "4": 1021042880, "5": 1021038590, "6": 1021042880, "7": 1021038590, "8": 1021038590, "9": 1021045168, "10": 1021045168, "11": 1021045168, "12": 1021042880, "13": 1021042880, "14": 1021042880, "15": 1021042880, "16": 1021042880, "17": 1021042880, "18":... | [] | ok | 106,188,434,352 | s044261625 | #include<stdio.h>
int main()
{
int N;
int O;
int Z;
scanf("%d",&N);
if(N%2!=0){
printf("%d",N/2+1);
}
else if(N%2==0)
printf("%d",N/2);
return 0;
} | {"0": 193656034, "1": 193731538, "2": 193656034, "3": 193652888, "4": 193734684, "5": 193718668, "6": 193734684, "7": 193656034, "8": 193718668, "9": 193713806, "10": 193713806, "11": 193652888, "12": 193731538, "13": 193731538, "14": 193731538, "15": 193737830, "16": 193731538, "17": 193731538, "18": 193737830, "19": ... | ok | 5.270388 | 5.270388 | [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 | 5.31793 | false | false | false | 5.327457 | 0.105615 | 0.019825 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998553 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.270672 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s205275641 | train | cpp | #include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
if(n%2==0)
n/=2;
else
n=n/2+1;
cout<<n<<endl;
return 0;
} | {"0": 1021718698, "1": 1021950930, "2": 1021718698, "3": 1021718698, "4": 1021950930, "5": 1021718698, "6": 1021950930, "7": 1021718698, "8": 1021718698, "9": 1021718698, "10": 1021718698, "11": 1021718698, "12": 1021718698, "13": 1021718698, "14": 1021718698, "15": 1021718698, "16": 1021718698, "17": 1021718698, "18":... | [] | ok | 106,271,285,120 | s044261625 | #include<stdio.h>
int main()
{
int N;
int O;
int Z;
scanf("%d",&N);
if(N%2!=0){
printf("%d",N/2+1);
}
else if(N%2==0)
printf("%d",N/2);
return 0;
} | {"0": 193656034, "1": 193731538, "2": 193656034, "3": 193652888, "4": 193734684, "5": 193718668, "6": 193734684, "7": 193656034, "8": 193718668, "9": 193713806, "10": 193713806, "11": 193652888, "12": 193731538, "13": 193731538, "14": 193731538, "15": 193737830, "16": 193731538, "17": 193731538, "18": 193737830, "19": ... | ok | 5.2745 | 5.2745 | [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 | 5.32208 | false | false | false | 5.324355 | 0.105553 | 0.019825 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998552 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.274784 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s075098422 | train | cpp | #include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int m=(n+1)/2;
cout<<m<<endl;
return 0;
} | {"0": 1021628036, "1": 1021950930, "2": 1021628036, "3": 1021628036, "4": 1021950930, "5": 1021628036, "6": 1021950930, "7": 1021628036, "8": 1021628036, "9": 1021628036, "10": 1021628036, "11": 1021628036, "12": 1021628036, "13": 1021628036, "14": 1021628036, "15": 1021628036, "16": 1021628036, "17": 1021628036, "18":... | [] | ok | 106,266,693,676 | s044261625 | #include<stdio.h>
int main()
{
int N;
int O;
int Z;
scanf("%d",&N);
if(N%2!=0){
printf("%d",N/2+1);
}
else if(N%2==0)
printf("%d",N/2);
return 0;
} | {"0": 193656034, "1": 193731538, "2": 193656034, "3": 193652888, "4": 193734684, "5": 193718668, "6": 193734684, "7": 193656034, "8": 193718668, "9": 193713806, "10": 193713806, "11": 193652888, "12": 193731538, "13": 193731538, "14": 193731538, "15": 193737830, "16": 193731538, "17": 193731538, "18": 193737830, "19": ... | ok | 5.274272 | 5.274272 | [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 | 5.32185 | false | false | false | 5.324435 | 0.105555 | 0.019825 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998552 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.274557 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s197562254 | train | cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 300005;
int n;
int main()
{
cin >> n ;
cout << n/2 + n%2;
return 0;
}
| {"0": 1020373068, "1": 1020691672, "2": 1020373068, "3": 1020372210, "4": 1020691672, "5": 1020373068, "6": 1020691672, "7": 1020373068, "8": 1020373068, "9": 1020372210, "10": 1020372210, "11": 1020372210, "12": 1020372210, "13": 1020372210, "14": 1020372210, "15": 1020372210, "16": 1020372210, "17": 1020372210, "18":... | [] | ok | 106,135,201,744 | s044261625 | #include<stdio.h>
int main()
{
int N;
int O;
int Z;
scanf("%d",&N);
if(N%2!=0){
printf("%d",N/2+1);
}
else if(N%2==0)
printf("%d",N/2);
return 0;
} | {"0": 193656034, "1": 193731538, "2": 193656034, "3": 193652888, "4": 193734684, "5": 193718668, "6": 193734684, "7": 193656034, "8": 193718668, "9": 193713806, "10": 193713806, "11": 193652888, "12": 193731538, "13": 193731538, "14": 193731538, "15": 193737830, "16": 193731538, "17": 193731538, "18": 193737830, "19": ... | ok | 5.267746 | 5.267746 | [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 | 5.315265 | false | false | false | 5.304981 | 0.105169 | 0.019825 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998545 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.26803 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s059342982 | train | cpp | #include <iostream>
using namespace std;
int main ()
{
int num ,re;
cin >>num;
if ( num%2==0)
{
re =num/2;
}
else {
re =num/2;
re+=1;
}
cout <<re ;
system("pause");
}
| {"0": 1023314864, "1": 1023314864, "2": 1023314864, "3": 1023314864, "4": 1023314864, "5": 1023314864, "6": 1023314864, "7": 1023314864, "8": 1023314864, "9": 1023314864, "10": 1023314864, "11": 1023314864, "12": 1023314864, "13": 1023314864, "14": 1023314864, "15": 1023314864, "16": 1023314864, "17": 1023314864, "18":... | [] | ok | 106,424,745,856 | s950245280 | #include <stdio.h>
int main(){
int a,b;
scanf("%d", &a);
b = a/2;
if(a%2==1){
printf("%d", b+1);
}else{
printf("%d", b);
}
} | {"0": 193710660, "1": 193726676, "2": 193710660, "3": 193652316, "4": 193731252, "5": 193652888, "6": 193731252, "7": 193710660, "8": 193652888, "9": 193649742, "10": 193649742, "11": 193652316, "12": 193732968, "13": 193732968, "14": 193732968, "15": 193731252, "16": 193732968, "17": 193732968, "18": 193731252, "19": ... | ok | 5.282214 | 5.282214 | [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 | 5.329765 | false | false | false | 5.333458 | 0.105731 | 0.019824 | 0.0197 | Accepted | Accepted | 0.0197 | 0.99856 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.282401 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s946770737 | train | cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
cout << (t + 1) / 2 << endl;
}
| {"0": 1034767448, "1": 1036006114, "2": 1034767448, "3": 1034762586, "4": 1036006114, "5": 1034767448, "6": 1036006114, "7": 1034767448, "8": 1034767448, "9": 1034762586, "10": 1034762586, "11": 1034762586, "12": 1036006114, "13": 1036006114, "14": 1036006114, "15": 1036006114, "16": 1036006114, "17": 1036006114, "18":... | [] | ok | 107,729,752,416 | s950245280 | #include <stdio.h>
int main(){
int a,b;
scanf("%d", &a);
b = a/2;
if(a%2==1){
printf("%d", b+1);
}else{
printf("%d", b);
}
} | {"0": 193710660, "1": 193726676, "2": 193710660, "3": 193652316, "4": 193731252, "5": 193652888, "6": 193731252, "7": 193710660, "8": 193652888, "9": 193649742, "10": 193649742, "11": 193652316, "12": 193732968, "13": 193732968, "14": 193732968, "15": 193731252, "16": 193732968, "17": 193732968, "18": 193731252, "19": ... | ok | 5.346986 | 5.346986 | [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 | 5.39512 | false | false | false | 5.383471 | 0.106723 | 0.019824 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998577 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.347176 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s190737987 | train | cpp | #include<iostream>
using namespace std;
int main()
{
int n;
while(cin>>n)
cout<<n/2+n%2<<endl;
return 0;
}
| {"0": 1022221486, "1": 1022508916, "2": 1022221486, "3": 1022221486, "4": 1022508916, "5": 1022221486, "6": 1022508916, "7": 1022221486, "8": 1022221486, "9": 1022221486, "10": 1022221486, "11": 1022221486, "12": 1022513778, "13": 1022513778, "14": 1022513778, "15": 1022513778, "16": 1022513778, "17": 1022513778, "18":... | [] | ok | 106,337,794,134 | s250777891 | #include <stdio.h>
int main()
{
int N;
scanf ("%d", &N);
(N%2 == 0) ? printf ("%d", N/2) : printf ("%d", N/2 + 1);
return 0;
} | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "19": ... | ok | 5.278086 | 5.278086 | [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 | 5.32541 | false | false | false | 5.328441 | 0.105634 | 0.019825 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998553 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.278086 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s039591933 | train | cpp | #include <iostream>
int main()
{
int n;
std::cin >> n;
if (n % 2 != 0)
++n;
std::cout << n / 2 << '\n';
return 0;
} | {"0": 1020873282, "1": 1021161570, "2": 1020873282, "3": 1020873282, "4": 1020962514, "5": 1020873282, "6": 1020962514, "7": 1020873282, "8": 1020873282, "9": 1020873282, "10": 1020873282, "11": 1020873282, "12": 1020962514, "13": 1020962514, "14": 1020962514, "15": 1020962514, "16": 1020962514, "17": 1020962514, "18":... | [] | ok | 106,183,882,948 | s250777891 | #include <stdio.h>
int main()
{
int N;
scanf ("%d", &N);
(N%2 == 0) ? printf ("%d", N/2) : printf ("%d", N/2 + 1);
return 0;
} | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "19": ... | ok | 5.270446 | 5.270446 | [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 | 5.317702 | false | false | false | 5.328528 | 0.105636 | 0.019825 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998553 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.270446 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s979271794 | train | cpp | #include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
if(n%2==0)
cout<<n/2<<endl;
else
cout<<(n/2+1)<<endl;
return 0;
} | {"0": 1021641192, "1": 1021641192, "2": 1021641192, "3": 1021641192, "4": 1021641192, "5": 1021641192, "6": 1021641192, "7": 1021641192, "8": 1021641192, "9": 1021641192, "10": 1021641192, "11": 1021641192, "12": 1021641192, "13": 1021641192, "14": 1021641192, "15": 1021641192, "16": 1021641192, "17": 1021641192, "18":... | [] | ok | 106,250,993,134 | s250777891 | #include <stdio.h>
int main()
{
int N;
scanf ("%d", &N);
(N%2 == 0) ? printf ("%d", N/2) : printf ("%d", N/2 + 1);
return 0;
} | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "19": ... | ok | 5.273777 | 5.273777 | [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 | 5.321063 | false | false | false | 5.324759 | 0.105561 | 0.019825 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998552 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.273777 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s348053837 | train | cpp | #include <bits/stdc++.h>
using namespace std;
/*
#define mod 7
typedef long long ll;
ll fact[1000006], inv[1000006];
ll fp(ll base, ll exp)
{
if (exp == 0)
return 1;
ll ans = fp(base, exp / 2);
ans = (ans * ans) % mod;
if (exp % 2 != 0)
ans = (ans * (base % mod)) % mod;
... | {"0": 3604891862, "1": 3605426396, "2": 3604891862, "3": 3605271098, "4": 3605333446, "5": 3605333446, "6": 3605333446, "7": 3604891862, "8": 3605333446, "9": 3605271098, "10": 3605271098, "11": 3605271098, "12": 3605333446, "13": 3605333446, "14": 3605333446, "15": 3604892148, "16": 3605333446, "17": 3605333446, "18":... | [] | ok | 374,946,067,210 | s177320605 | #include <stdio.h>
int main() {
int a, b;
scanf("%d", &a);
b = a / 2;
if(a % 2 == 1) {
printf("%d", b + 1);
} else {
printf("%d", b);
}
return 0;
} | {"0": 193710660, "1": 193726676, "2": 193710660, "3": 193652316, "4": 193731252, "5": 193652888, "6": 193731252, "7": 193710660, "8": 193652888, "9": 193649742, "10": 193649742, "11": 193652316, "12": 193732968, "13": 193732968, "14": 193732968, "15": 193731252, "16": 193732968, "17": 193732968, "18": 193731252, "19": ... | ok | 18.609819 | 18.609819 | [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 | 18.777347 | false | false | false | 18.899871 | 0.374673 | 0.019824 | 0.0197 | Accepted | Accepted | 0.0197 | 0.999651 | 10 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 18.61048 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s116427121 | train | cpp | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
#define MohamedMotaz ios::sync_with_stdio(0); cin.tie(0); ios_base::sync_with_stdio(0);
using namespace std;
int main()
{
MohamedMotaz;
ll x;
cin >> x;
cout << ceil... | {"0": 1045765292, "1": 1047148102, "2": 1045765292, "3": 1045763862, "4": 1047148102, "5": 1045765292, "6": 1047271368, "7": 1045765292, "8": 1045765292, "9": 1045848232, "10": 1045763862, "11": 1045848232, "12": 1047271368, "13": 1047148102, "14": 1047271368, "15": 1047148102, "16": 1047148102, "17": 1047271368, "18":... | [] | ok | 108,891,405,194 | s177320605 | #include <stdio.h>
int main() {
int a, b;
scanf("%d", &a);
b = a / 2;
if(a % 2 == 1) {
printf("%d", b + 1);
} else {
printf("%d", b);
}
return 0;
} | {"0": 193710660, "1": 193726676, "2": 193710660, "3": 193652316, "4": 193731252, "5": 193652888, "6": 193731252, "7": 193710660, "8": 193652888, "9": 193649742, "10": 193649742, "11": 193652316, "12": 193732968, "13": 193732968, "14": 193732968, "15": 193731252, "16": 193732968, "17": 193732968, "18": 193731252, "19": ... | ok | 5.404642 | 5.404642 | [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 | 5.453296 | false | false | false | 5.452617 | 0.108093 | 0.019824 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998599 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.404834 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s221894298 | train | cpp | #include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll num;
cin>>num;
cout<<num/2 + num %2;
return 0;
} | {"0": 1019026580, "1": 1019301712, "2": 1019026580, "3": 1019249374, "4": 1019301712, "5": 1019026580, "6": 1019301712, "7": 1019026580, "8": 1019026580, "9": 1019249374, "10": 1019249374, "11": 1019249374, "12": 1019249374, "13": 1019249374, "14": 1019249374, "15": 1019249374, "16": 1019249374, "17": 1019249374, "18":... | [] | ok | 106,002,790,036 | s177320605 | #include <stdio.h>
int main() {
int a, b;
scanf("%d", &a);
b = a / 2;
if(a % 2 == 1) {
printf("%d", b + 1);
} else {
printf("%d", b);
}
return 0;
} | {"0": 193710660, "1": 193726676, "2": 193710660, "3": 193652316, "4": 193731252, "5": 193652888, "6": 193731252, "7": 193710660, "8": 193652888, "9": 193649742, "10": 193649742, "11": 193652316, "12": 193732968, "13": 193732968, "14": 193732968, "15": 193731252, "16": 193732968, "17": 193732968, "18": 193731252, "19": ... | ok | 5.261271 | 5.261271 | [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 | 5.308633 | false | false | false | 5.303598 | 0.105139 | 0.019824 | 0.0197 | Accepted | Accepted | 0.0197 | 0.99855 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.261458 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s519138316 | train | cpp | #include <iostream>
#define ll long long
using namespace std;
int main()
{ ll n;
cin>>n;
if(n%2==0)
cout << n/2;
else
cout << (n/2)+1 << endl;
return 0;
}
| {"0": 1021254234, "1": 1019358054, "2": 1021254234, "3": 1021332312, "4": 1021240220, "5": 1019289700, "6": 1021240220, "7": 1021254234, "8": 1019289700, "9": 1019352620, "10": 1019352620, "11": 1021332312, "12": 1019351762, "13": 1019351762, "14": 1019351762, "15": 1021240220, "16": 1019351762, "17": 1019351762, "18":... | [] | ok | 106,118,461,020 | s177320605 | #include <stdio.h>
int main() {
int a, b;
scanf("%d", &a);
b = a / 2;
if(a % 2 == 1) {
printf("%d", b + 1);
} else {
printf("%d", b);
}
return 0;
} | {"0": 193710660, "1": 193726676, "2": 193710660, "3": 193652316, "4": 193731252, "5": 193652888, "6": 193731252, "7": 193710660, "8": 193652888, "9": 193649742, "10": 193649742, "11": 193652316, "12": 193732968, "13": 193732968, "14": 193732968, "15": 193731252, "16": 193732968, "17": 193732968, "18": 193731252, "19": ... | ok | 5.267012 | 5.267012 | [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 | 5.314426 | false | false | false | 5.323696 | 0.105538 | 0.019824 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998557 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.267199 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s409968778 | train | cpp | #include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
if(n%2==0){
cout<<n/2;
}
else{
cout<<n/2+1;
}
return 0;
}
| {"0": 1011609456, "1": 1011609456, "2": 1011609456, "3": 1011609456, "4": 1011988120, "5": 1011609456, "6": 1011988120, "7": 1011609456, "8": 1011609456, "9": 1011609456, "10": 1011609456, "11": 1011609456, "12": 1011630906, "13": 1011630906, "14": 1011630906, "15": 1011617178, "16": 1011630906, "17": 1011630906, "18":... | [] | ok | 105,219,686,000 | s177320605 | #include <stdio.h>
int main() {
int a, b;
scanf("%d", &a);
b = a / 2;
if(a % 2 == 1) {
printf("%d", b + 1);
} else {
printf("%d", b);
}
return 0;
} | {"0": 193710660, "1": 193726676, "2": 193710660, "3": 193652316, "4": 193731252, "5": 193652888, "6": 193731252, "7": 193710660, "8": 193652888, "9": 193649742, "10": 193649742, "11": 193652316, "12": 193732968, "13": 193732968, "14": 193732968, "15": 193731252, "16": 193732968, "17": 193732968, "18": 193731252, "19": ... | ok | 5.222403 | 5.222403 | [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 | 5.269415 | false | false | false | 5.30695 | 0.105206 | 0.019824 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998551 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.222588 | null | null | null | null | null | null | null | null | null | null | null |
p02759 | s930392635 | train | cpp | #include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
cout<<(n+1)/2;
} | {"0": 1019746442, "1": 1019754450, "2": 1019746442, "3": 1019745870, "4": 1019754450, "5": 1019746442, "6": 1019754450, "7": 1019746442, "8": 1019746442, "9": 1019745870, "10": 1019745870, "11": 1019745870, "12": 1019738148, "13": 1019738148, "14": 1019738148, "15": 1019738148, "16": 1019738148, "17": 1019738148, "18":... | [] | ok | 106,053,864,774 | s177320605 | #include <stdio.h>
int main() {
int a, b;
scanf("%d", &a);
b = a / 2;
if(a % 2 == 1) {
printf("%d", b + 1);
} else {
printf("%d", b);
}
return 0;
} | {"0": 193710660, "1": 193726676, "2": 193710660, "3": 193652316, "4": 193731252, "5": 193652888, "6": 193731252, "7": 193710660, "8": 193652888, "9": 193649742, "10": 193649742, "11": 193652316, "12": 193732968, "13": 193732968, "14": 193732968, "15": 193731252, "16": 193732968, "17": 193732968, "18": 193731252, "19": ... | ok | 5.263806 | 5.263806 | [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 | 5.311191 | false | false | false | 5.305121 | 0.105169 | 0.019824 | 0.0197 | Accepted | Accepted | 0.0197 | 0.998551 | 9 | s250777891 | {"0": 193735828, "1": 193721242, "2": 193735828, "3": 193707800, "4": 193703224, "5": 193648312, "6": 193703224, "7": 193735828, "8": 193648312, "9": 193670048, "10": 193670048, "11": 193707800, "12": 193722386, "13": 193722386, "14": 193722386, "15": 193735256, "16": 193722386, "17": 193722386, "18": 193735256, "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,147,038,626 | 5.263993 | null | null | null | null | null | null | null | null | null | null | null |
p00168 | s234135117 | train | cpp | #include <iostream>
using namespace std;
int n;
int saiki(int ima)
{
if(ima == n)
return 1;
if(ima > n)
return 0;
int res = 0;
res += saiki(ima + 1) + saiki(ima + 2) + saiki(ima + 3);
return res;
}
int main() {
while (true){
cin >> n;
if (n == 0)
break;
int ans,a;
ans = s... | {"1": 10010082940, "2": 1066143936, "4": 17516718648, "5": 1027201604, "6": 1844374532, "7": 1449734286, "9": 1022427692, "10": 10010149578, "12": 10006499074, "13": 1818648260, "14": 1092776828, "15": 10200689928, "16": 1293619756, "17": 3669120884, "18": 1151349342, "19": 5106985312, "22": 17745365066, "23": 11997528... | [0, 3, 8, 11, 20, 21, 25, 30, 32, 35, 39, 40, 41, 46, 51, 52, 54, 55, 56, 57, 59, 65, 67, 71, 72] | forkloop_partial | 258,622,168,376 | s590209221 | #include <iostream>
using namespace std;
int main()
{
int n, cnt, y;
int c[31];
c[0] = 1;
c[1] = 1;
c[2] = 2;
for( int i=3; i<=30; i++ )
c[i] = c[i-1] + c[i-2] + c[i-3];
while( cin >> n, n != 0 ){
y = c[n]/(365*10);
y += !( c[n]%(365*10) == 0 );
cout << y << endl;
}
return 0;
} | {"0": 1024384218, "1": 1024384218, "2": 1024253230, "3": 1024372778, "4": 1024384218, "5": 1023313434, "6": 1024288408, "7": 1023310574, "8": 1024387364, "9": 1022207186, "10": 1024382788, "11": 1024389080, "12": 1023888866, "13": 1024369060, "14": 1023313434, "15": 1023888866, "16": 1023877426, "17": 1023869418, "18":... | ok | 3.691549 | 5.050959 | [1, 2, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 49, 50, 53, 58, 61, 62, 64, 66, 68, 69, 70, 73, 74] | [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... | [1, 2, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 49, 50, 53, 58, 61, 62, 64, 66, 68, 69, 70, 73, 74] | 45 | 102 | 45 | 102 | 0 | 19.689031 | false | false | false | 1.506452 | 0.053641 | 0.035607 | 0.035596 | Accepted | Accepted | 0.035607 | 1 | 10 | s030237519 | {"0": 1023686664, "1": 1023684948, "2": 1023277970, "3": 1023687808, "4": 1023686664, "5": 1022584134, "6": 1023290554, "7": 1022683948, "8": 1023689810, "9": 1021565116, "10": 1023699820, "11": 1023676654, "12": 1023193028, "13": 1023683232, "14": 1022584134, "15": 1023193028, "16": 1023137544, "17": 1023192742, "18":... | [1, 2, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 49, 50, 53, 58, 61, 62, 64, 66, 68, 69, 70, 73, 74] | 46,046,953,524 | 3.694343 | null | null | null | null | null | null | null | null | null | null | null |
p00168 | s714800928 | train | cpp | #include <iostream>
using namespace std;
long long int kaidan (int n) {
if (n == 0) {
return 1;
} else {
if (n >= 3) {
return kaidan(n-3)+kaidan(n-2)+kaidan(n-1);
} else if (n > 1) {
return kaidan(n-2)+kaidan(n-1);
} else {
return kaidan(n-1);
}
}
}
int main() {
int n;
w... | {"0": 16157319178, "1": 5468749858, "2": 1041888562, "3": 16824285764, "4": 9228157796, "5": 1024605296, "6": 1406995304, "7": 1220247600, "8": 16315070772, "9": 1021513064, "10": 5467933900, "11": 17042378782, "12": 5466896292, "13": 1397691438, "14": 1053582816, "15": 5552822418, "16": 1141409126, "17": 2307948500, "... | [25, 30, 32, 39, 40, 41, 46, 51, 52, 54, 55, 56, 67, 72, 75, 76, 78, 80, 81, 82, 84, 85, 91] | ok | 521,727,957,322 | s234864841 | #include <iostream>
#include <cmath>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0) {
break;
}
vector<int> dp(31, 0);
dp[0] = 1;
dp[1] = 1;
dp[2] = 2;
for (int j = 3; j <= n; j++) {
dp[j] = dp[j-1]+dp[j-2]+dp[j-3];
}
int y = dp[n]... | {"0": 1034655908, "1": 1034670208, "2": 1034590414, "3": 1034650474, "4": 1034681648, "5": 1033201312, "6": 1034641894, "7": 1033323148, "8": 1034679646, "9": 1031736134, "10": 1034667920, "11": 1034711392, "12": 1034069894, "13": 1034676214, "14": 1033303986, "15": 1034087054, "16": 1033672354, "17": 1033610864, "18":... | ok | 3.047716 | 6.384962 | [1, 2, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 48, 49, 50, 53, 58, 60, 61, 62, 63, 64, 66, 68, 69, 70, 73, 74, 79, 83, 86, 88, 89, 90, 92, 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... | [1, 2, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 48, 49, 50, 53, 58, 60, 61, 62, 63, 64, 66, 68, 69, 70, 73, 74, 79, 83, 86, 88, 89, 90, 92, 94, 95] | 59 | 102 | 59 | 102 | 0 | 16.417191 | false | false | false | 1.227985 | 0.044068 | 0.035887 | 0.035596 | Accepted | Accepted | 0.035607 | 0.966992 | 6 | s030237519 | {"0": 1023686664, "1": 1023684948, "2": 1023277970, "3": 1023687808, "4": 1023686664, "5": 1022584134, "6": 1023290554, "7": 1022683948, "8": 1023689810, "9": 1021565116, "10": 1023699820, "11": 1023676654, "12": 1023193028, "13": 1023683232, "14": 1022584134, "15": 1023193028, "16": 1023137544, "17": 1023192742, "18":... | [1, 2, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 48, 49, 50, 53, 58, 60, 61, 62, 63, 64, 66, 68, 69, 70, 73, 74, 79, 83, 86, 88, 89, 90, 92, 94, 95] | 60,375,132,818 | 3.080307 | null | null | null | null | null | null | null | null | null | null | null |
p00168 | s316852515 | train | cpp | #include<iostream>
using namespace std;
class Answer
{
public:
Answer(){day = 10; year = 365;}
int N; //??\???
int day;
int year;
unsigned long long count(int cnt); //??¨??¢?´¢(???)
void set(); //??\???
void OutPut(); //???????????????
bool empty(); //???????????¶?????????
bool ans(); //?§... | {"1": 12331879274, "2": 1077140350, "4": 21776456988, "5": 1028539798, "6": 2058243616, "7": 1560548418, "9": 1022207186, "10": 12336118652, "12": 12331709104, "13": 2025545808, "14": 1110844592, "15": 12575699422, "16": 1364081290, "17": 4353959038, "18": 1184883414, "19": 6165352908, "22": 22124894506, "23": 12457024... | [0, 3, 8, 11, 20, 21, 25, 30, 32, 35, 39, 40, 41, 46, 51, 52, 54, 55, 56, 57, 59, 65, 67, 71, 72, 75, 76, 77, 78, 80, 81, 82, 83, 84, 85, 86, 87, 91] | forkloop_partial | 324,441,832,858 | s899915828 | #include<iostream>
using namespace std;
#define MEMO_MAX 100
typedef unsigned long long ULL;
bool Flag_memo_g = true; //?????¢??????????????????
class Answer
{
public:
Answer()
{
day = 10; year = 365;
for(int i = 0; i < MEMO_MAX; i++)
{
memo[i] = 0;
Flag_memo[i] = false;
}
}
... | {"0": 1024826946, "1": 1024826946, "2": 1024611874, "3": 1024823800, "4": 1024826946, "5": 1023292556, "6": 1024633896, "7": 1023309716, "8": 1024826946, "9": 1021792486, "10": 1024727704, "11": 1024826946, "12": 1023960080, "13": 1024823800, "14": 1023292556, "15": 1023960080, "16": 1023941204, "17": 1024275252, "18":... | ok | 4.184889 | 5.758904 | [1, 2, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 49, 50, 53, 58, 61, 62, 64, 66, 68, 69, 70, 73, 74, 79, 88, 89, 90, 92] | [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... | [1, 2, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 49, 50, 53, 58, 61, 62, 64, 66, 68, 69, 70, 73, 74, 79, 88, 89, 90, 92] | 50 | 102 | 50 | 102 | 0 | 22.325881 | false | false | false | 1.641185 | 0.058463 | 0.035623 | 0.035596 | Accepted | Accepted | 0.035607 | 0.999335 | 10 | s030237519 | {"0": 1023686664, "1": 1023684948, "2": 1023277970, "3": 1023687808, "4": 1023686664, "5": 1022584134, "6": 1023290554, "7": 1022683948, "8": 1023689810, "9": 1021565116, "10": 1023699820, "11": 1023676654, "12": 1023193028, "13": 1023683232, "14": 1022584134, "15": 1023193028, "16": 1023137544, "17": 1023192742, "18":... | [1, 2, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 49, 50, 53, 58, 61, 62, 64, 66, 68, 69, 70, 73, 74, 79, 88, 89, 90, 92] | 51,163,387,704 | 4.189098 | null | null | null | null | null | null | null | null | null | null | null |
p00168 | s935603082 | train | cpp | #include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
typed... | {"1": 9458871136, "2": 1067242462, "4": 16502222022, "5": 1029944630, "6": 1796438072, "7": 1426243676, "9": 1024545808, "10": 9458515352, "12": 9454793920, "13": 1772449822, "14": 1091512708, "15": 9636742258, "16": 1279749328, "17": 3508747242, "18": 1146281994, "19": 4858853714, "22": 16715807108, "23": 1191723104, ... | [0, 3, 8, 11, 20, 21, 25, 30, 32, 35, 39, 40, 41, 46, 51, 52, 54, 55, 56, 57, 59, 65, 67, 71, 72, 75, 76, 77, 78, 80, 81, 82, 84, 85] | forkloop_partial | 266,790,890,080 | s882107366 | #include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
typed... | {"0": 1028880138, "1": 1028880424, "2": 1028477450, "3": 1028902732, "4": 1028885000, "5": 1025850826, "6": 1028157988, "7": 1026326444, "8": 1028423682, "9": 1024397946, "10": 1028313286, "11": 1029002546, "12": 1027190736, "13": 1028417676, "14": 1025873134, "15": 1027165282, "16": 1027348322, "17": 1027337168, "18":... | ok | 3.463869 | 4.992401 | [1, 2, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 49, 50, 53, 58, 61, 62, 64, 66, 68, 69, 70, 73, 74, 79] | [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... | [1, 2, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 49, 50, 53, 58, 61, 62, 64, 66, 68, 69, 70, 73, 74, 79] | 46 | 102 | 46 | 102 | 0 | 18.538893 | false | false | false | 1.472653 | 0.052709 | 0.035792 | 0.035596 | Accepted | Accepted | 0.035607 | 0.989218 | 6 | s030237519 | {"0": 1023686664, "1": 1023684948, "2": 1023277970, "3": 1023687808, "4": 1023686664, "5": 1022584134, "6": 1023290554, "7": 1022683948, "8": 1023689810, "9": 1021565116, "10": 1023699820, "11": 1023676654, "12": 1023193028, "13": 1023683232, "14": 1022584134, "15": 1023193028, "16": 1023137544, "17": 1023192742, "18":... | [1, 2, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 49, 50, 53, 58, 61, 62, 64, 66, 68, 69, 70, 73, 74, 79] | 47,069,537,658 | 3.478587 | null | null | null | null | null | null | null | null | null | null | null |
p00168 | s492152064 | train | cpp | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <b... | {"0": 22915627020, "1": 7516401750, "2": 1054288378, "3": 23925322564, "4": 12940493280, "5": 1025649768, "6": 1616755712, "7": 1331257928, "8": 23193439126, "9": 1021933770, "10": 7516527876, "11": 24232300950, "12": 7514143780, "13": 1597855116, "14": 1073290504, "15": 7654153364, "16": 1217945300, "17": 2934694048, ... | [20, 21, 25, 30, 32, 39, 40, 41, 46, 51, 52, 54, 55, 56, 67, 72, 75, 76, 78, 80, 81, 82, 84, 85, 91] | forkloop_partial | 619,636,988,828 | s204422400 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <b... | {"0": 1023674938, "1": 1023647196, "2": 1023659494, "3": 1023660352, "4": 1023674938, "5": 1022598434, "6": 1023669504, "7": 1022598434, "8": 1023666072, "9": 1021551674, "10": 1023647196, "11": 1023658636, "12": 1023192742, "13": 1023658636, "14": 1022598434, "15": 1023192742, "16": 1023114378, "17": 1023124388, "18":... | ok | 3.649058 | 8.072969 | [1, 2, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 48, 49, 50, 53, 58, 60, 61, 62, 63, 64, 66, 68, 69, 70, 73, 74, 79, 88, 89, 90, 92, 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... | [1, 2, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 48, 49, 50, 53, 58, 60, 61, 62, 63, 64, 66, 68, 69, 70, 73, 74, 79, 88, 89, 90, 92, 94, 95] | 57 | 102 | 57 | 102 | 0 | 19.448882 | false | false | false | 1.36544 | 0.048636 | 0.035619 | 0.035596 | Accepted | Accepted | 0.035607 | 0.999074 | 9 | s030237519 | {"0": 1023686664, "1": 1023684948, "2": 1023277970, "3": 1023687808, "4": 1023686664, "5": 1022584134, "6": 1023290554, "7": 1022683948, "8": 1023689810, "9": 1021565116, "10": 1023699820, "11": 1023676654, "12": 1023193028, "13": 1023683232, "14": 1022584134, "15": 1023193028, "16": 1023137544, "17": 1023192742, "18":... | [1, 2, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 48, 49, 50, 53, 58, 60, 61, 62, 63, 64, 66, 68, 69, 70, 73, 74, 79, 88, 89, 90, 92, 94, 95] | 58,327,779,510 | 3.64918 | null | null | null | null | null | null | null | null | null | null | null |
p00168 | s999300474 | train | cpp | #include <iostream>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
using namespace std;
int func(int kaidan,int now){
int a=0,b=0,c=0;
if(now==kaidan){
return 1;
}else if(now>kaidan){
return 0;
}else{
a+=func(kaidan,now+1);
b+=func(kaidan,now+2);
c+=func(kai... | {"1": 11832547012, "2": 1074483410, "4": 20860959834, "5": 1028157988, "6": 2010433854, "7": 1536031354, "9": 1022172580, "10": 11830428610, "12": 11826064536, "13": 1979794960, "14": 1107093702, "15": 12059174556, "16": 1348048988, "17": 4205086886, "18": 1177035002, "19": 5934246032, "22": 21134520550, "23": 12346737... | [0, 3, 8, 11, 20, 21, 25, 30, 32, 35, 39, 40, 41, 46, 51, 52, 54, 55, 56, 57, 59, 65, 67, 71, 72, 75, 76, 77, 78, 80, 81, 82, 84, 85, 86] | forkloop_partial | 326,751,864,868 | s299009527 | #include <iostream>
using namespace std;
int memo[31];
int main(){
int n,ans;
memo[0]=1;
memo[1]=1;
memo[2]=2;
for(int i=3;i<31;i++){
memo[i]=memo[i-1]+memo[i-2]+memo[i-3];
}
while(cin>>n){
if(n==0)break;
cout<<memo[n]/(365*10)+1<<endl;
}
return 0;
} | {"0": 1023939774, "1": 1023939774, "2": 1023946638, "3": 1023956076, "4": 1023939774, "5": 1023004268, "6": 1023946638, "7": 1023010846, "8": 1023944922, "9": 1021871136, "10": 1023956362, "11": 1023944922, "12": 1023310002, "13": 1023939774, "14": 1023004268, "15": 1023310002, "16": 1023293414, "17": 1023293128, "18":... | ok | 4.171283 | 6.138539 | [1, 2, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 49, 50, 53, 58, 61, 62, 64, 66, 68, 69, 70, 73, 74, 79] | [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... | [1, 2, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 49, 50, 53, 58, 61, 62, 64, 66, 68, 69, 70, 73, 74, 79] | 46 | 102 | 46 | 102 | 0 | 22.238744 | false | false | false | 1.608711 | 0.057308 | 0.035624 | 0.035596 | Accepted | Accepted | 0.035607 | 0.999242 | 10 | s030237519 | {"0": 1023686664, "1": 1023684948, "2": 1023277970, "3": 1023687808, "4": 1023686664, "5": 1022584134, "6": 1023290554, "7": 1022683948, "8": 1023689810, "9": 1021565116, "10": 1023699820, "11": 1023676654, "12": 1023193028, "13": 1023683232, "14": 1022584134, "15": 1023193028, "16": 1023137544, "17": 1023192742, "18":... | [1, 2, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 49, 50, 53, 58, 61, 62, 64, 66, 68, 69, 70, 73, 74, 79] | 47,069,537,658 | 4.172817 | null | null | null | null | null | null | null | null | null | null | null |
p00168 | s977548035 | train | cpp | #include <iostream>
int n;
int cmb;
int dp[30];
int func(int now){
if(now > n)
return 0;
if(now == n){
dp[now] = 1;
return 1;
}
return func(now+1) + func(now+2) + func(now+3);
}
int main(void){
while(1){
int ans;
std::cin >> n;
for(int i=0; i < 30; i++){
... | {"1": 8965496826, "2": 1061090602} | [0] | forkloop_partial | 10,026,587,428 | s216127149 | #include <iostream>
int n;
int cmb;
int dp[31];
/*
int func(int now){
if(now > n)
return 0;
if(now == n){
dp[now] = 1;
return 1;
}
return func(now+1) + func(now+2) + func(now+3);
}
*/
int func(int now){
int a[3];
if(now < 0){
return 0;
}
if(now == 0){
r... | {"0": 1026264668, "1": 1026264668, "2": 1025672934, "3": 1026274106, "4": 1026300990, "5": 1024610444, "6": 1025815934, "7": 1024721984, "8": 1025877710, "9": 1022219770, "10": 1025935768, "11": 1026460864, "12": 1025591138, "13": 1025855974, "14": 1024738572, "15": 1025602006, "16": 1025499618, "17": 1025490752, "18":... | ok | 4.8864 | 4.8864 | [1, 2] | [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... | [1, 2] | 2 | 102 | 2 | 102 | 0 | 26.110905 | false | false | false | 1.446447 | 0.051584 | 0.035663 | 0.035596 | Accepted | Accepted | 0.035607 | 0.996535 | 8 | s030237519 | {"0": 1023686664, "1": 1023684948, "2": 1023277970, "3": 1023687808, "4": 1023686664, "5": 1022584134, "6": 1023290554, "7": 1022683948, "8": 1023689810, "9": 1021565116, "10": 1023699820, "11": 1023676654, "12": 1023193028, "13": 1023683232, "14": 1022584134, "15": 1023193028, "16": 1023137544, "17": 1023192742, "18":... | [1, 2] | 2,046,962,918 | 4.898275 | null | null | null | null | null | null | null | null | null | null | null |
p00168 | s877145586 | train | cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0)... | {"0": 18849052222, "1": 6311096220, "2": 1048843796, "3": 19671016222, "4": 10725841984, "5": 1025485032, "6": 1506573068, "7": 1273711868, "8": 19071506454, "9": 1021565116, "10": 6309491760, "11": 19915241918, "12": 6307338466, "13": 1490858798, "14": 1064038976, "15": 6421223094, "16": 1182457848, "17": 2578320888, ... | [25, 30, 32, 39, 40, 41, 46, 51, 52, 54, 55, 56, 67, 72, 75, 76, 78, 80, 81, 82, 84, 85, 91] | ok | 602,805,273,642 | s030237519 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0)... | {"0": 1023686664, "1": 1023684948, "2": 1023277970, "3": 1023687808, "4": 1023686664, "5": 1022584134, "6": 1023290554, "7": 1022683948, "8": 1023689810, "9": 1021565116, "10": 1023699820, "11": 1023676654, "12": 1023193028, "13": 1023683232, "14": 1022584134, "15": 1023193028, "16": 1023137544, "17": 1023192742, "18":... | ok | 3.485386 | 7.456097 | [1, 2, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 48, 49, 50, 53, 58, 60, 61, 62, 63, 64, 66, 68, 69, 70, 73, 74, 79, 83, 86, 88, 89, 90, 92, 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... | [1, 2, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 48, 49, 50, 53, 58, 60, 61, 62, 63, 64, 66, 68, 69, 70, 73, 74, 79, 83, 86, 88, 89, 90, 92, 94, 95] | 59 | 102 | 59 | 102 | 0 | 18.576151 | false | false | false | 1.298502 | 0.046238 | 0.035608 | 0.035596 | Accepted | Accepted | 0.035607 | 0.99991 | 10 | s030237519 | {"0": 1023686664, "1": 1023684948, "2": 1023277970, "3": 1023687808, "4": 1023686664, "5": 1022584134, "6": 1023290554, "7": 1022683948, "8": 1023689810, "9": 1021565116, "10": 1023699820, "11": 1023676654, "12": 1023193028, "13": 1023683232, "14": 1022584134, "15": 1023193028, "16": 1023137544, "17": 1023192742, "18":... | [1, 2, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 26, 27, 28, 29, 31, 33, 34, 36, 37, 38, 42, 43, 44, 45, 47, 48, 49, 50, 53, 58, 60, 61, 62, 63, 64, 66, 68, 69, 70, 73, 74, 79, 83, 86, 88, 89, 90, 92, 94, 95] | 60,375,132,818 | 3.485386 | null | null | null | null | null | null | null | null | null | null | null |
p03952 | s632935760 | train | cpp | #include <iostream>
using namespace std;
int a[200005];
int main(int argc, char** argv) {
int n,m;
cin >> n >> m;
if(m==1||m==2*n-1)
{
puts("No");
return 0;
}
puts("Yes");
a[n]=m;
a[n-1]=m-1;
a[n+1]=m+1;
int now=0;
for(int i=1;i<n*2;i++)
{
if(i==n||i==n-1||i==n+1)
continue;
++... | {"0": 1014943072, "1": 1022617882, "2": 1022908744, "3": 1024211760, "4": 1023880000, "5": 1023336600, "6": 1024573836, "7": 1014943072, "8": 1014934492, "9": 1014943072, "10": 1014943072, "11": 1014943072, "12": 1014943072, "13": 1014943072, "14": 1015370928, "15": 1015028586, "16": 1015370928, "17": 1015028586, "18":... | [] | ok | 104,623,479,532 | s268140516 | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, x; scanf("%d%d", &n, &x);
if(x == 1 || x == 2 * n - 1) return puts("No"), 0;
puts("Yes"); int t = 1;
for(int i = 1; i < n - 1; i ++) {
while(abs(t - x) <= 1) t ++;
printf("%d\n", t ++);
}
printf("%d\n%d\n%d\n", x - 1,... | {"0": 191540778, "1": 195856518, "2": 196381614, "3": 198179982, "4": 197696642, "5": 197222740, "6": 198504020, "7": 191540778, "8": 191522760, "9": 191540778, "10": 191712664, "11": 191540778, "12": 191540778, "13": 191540778, "14": 191754992, "15": 191628580, "16": 191754992, "17": 191628580, "18": 191628580, "19": ... | ok | 5.290089 | 5.288324 | [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... | [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, ... | [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, ... | 103 | 100 | 100 | 103 | 2 | 5.290427 | false | false | false | 5.331172 | 0.080818 | 0.01516 | 0.015071 | Accepted | Accepted | 0.015071 | 0.998651 | 9 | s268140516 | {"0": 191540778, "1": 195856518, "2": 196381614, "3": 198179982, "4": 197696642, "5": 197222740, "6": 198504020, "7": 191540778, "8": 191522760, "9": 191540778, "10": 191712664, "11": 191540778, "12": 191540778, "13": 191540778, "14": 191754992, "15": 191628580, "16": 191754992, "17": 191628580, "18": 191628580, "19": ... | [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, ... | 19,198,561,668 | 5.290089 | null | null | null | null | null | null | null | null | null | null | null |
p02893 | s884688561 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(LL i = (l) ; i < (r); ++i)
#define incII(i, l, r) for(LL i = (l) ; i <= (r); ++i)
#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); --i)
#define decII(i, l, r) ... | {"0": 4354685764, "1": 4340709516, "2": 4341629292, "3": 4354757550, "4": 4340722958, "5": 4341582674, "6": 4354701494, "7": 4340683204, "8": 4341519182, "9": 4354777284, "10": 4340722958, "11": 4341536056, "12": 4354880816, "13": 4340727248, "14": 4341511460, "15": 4354943450, "16": 4340780730, "17": 4341540346, "18":... | [] | ok | 452,151,675,404 | s198077135 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(LL i = (l) ; i < (r); ++i)
#define incII(i, l, r) for(LL i = (l) ; i <= (r); ++i)
#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); --i)
#define decII(i, l, r) ... | {"0": 1043870828, "1": 1037011690, "2": 1037288538, "3": 1043975218, "4": 1037088910, "5": 1037288538, "6": 1043870828, "7": 1037136958, "8": 1037288538, "9": 1043870828, "10": 1037020270, "11": 1037288538, "12": 1043975218, "13": 1037020270, "14": 1037288538, "15": 1043975218, "16": 1037011690, "17": 1037288538, "18":... | ok | 4.179035 | 4.179035 | [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 | 22.643814 | false | false | false | 4.194245 | 0.451918 | 0.107747 | 0.020218 | Accepted | Accepted | 0.020218 | 0.797245 | 5 | s198077135 | {"0": 1043870828, "1": 1037011690, "2": 1037288538, "3": 1043975218, "4": 1037088910, "5": 1037288538, "6": 1043870828, "7": 1037136958, "8": 1037288538, "9": 1043870828, "10": 1037020270, "11": 1037288538, "12": 1043975218, "13": 1037020270, "14": 1037288538, "15": 1043975218, "16": 1037011690, "17": 1037288538, "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... | 108,195,246,016 | 4.179035 | null | null | null | null | null | null | null | null | null | null | null |
p02964 | s114450715 | train | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.sec... | {"0": 7510989772, "1": 7511043254, "2": 7510841338, "3": 7511067850, "4": 7510798152, "5": 7511918414, "6": 7510789000, "7": 7512202698, "8": 7511529168, "9": 7511886954, "10": 7511143926, "11": 7512348558, "12": 7510842196, "13": 7511270052, "14": 7511268336, "15": 7510730084, "16": 7510703772, "17": 7511286068, "18":... | [] | ok | 788,713,625,128 | s724769197 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.sec... | {"0": 1044319848, "1": 1047046572, "2": 1046704802, "3": 1049029696, "4": 1046682494, "5": 1054025830, "6": 1052030694, "7": 1050585250, "8": 1052681058, "9": 1048508318, "10": 1052583532, "11": 1053575666, "12": 1054019538, "13": 1050540920, "14": 1051066588, "15": 1044855526, "16": 1044908722, "17": 1050535486, "18":... | ok | 7.14553 | 7.14553 | [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... | 105 | 105 | 105 | 105 | 0 | 39.1227 | false | false | false | 7.213989 | 0.17273 | 0.023944 | 0.02298 | Accepted | Accepted | 0.02298 | 0.993561 | 7 | s724769197 | {"0": 1044319848, "1": 1047046572, "2": 1046704802, "3": 1049029696, "4": 1046682494, "5": 1054025830, "6": 1052030694, "7": 1050585250, "8": 1052681058, "9": 1048508318, "10": 1052583532, "11": 1053575666, "12": 1054019538, "13": 1050540920, "14": 1051066588, "15": 1044855526, "16": 1044908722, "17": 1050535486, "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... | 110,378,606,910 | 7.14553 | null | null | null | null | null | null | null | null | null | null | null |
p02964 | s938627930 | train | cpp | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int a[200005];
vector<int> v[200005];
int l[200005];
int re[200005];
int cnt[200005];
int c[200005];
int main()
{
ll n, k;
cin >> n >> k;
for(int i = 0; i < n; i++){
cin >> a[i];
cnt[a[i]]++;... | {"0": 6632126644, "1": 6631133938, "2": 6631030120, "3": 6632501018, "4": 6631497158, "5": 6631731964, "6": 6634936594, "7": 6632984072, "8": 6635646732, "9": 6633124212, "10": 6633121638, "11": 6635087316, "12": 6631806896, "13": 6632299102, "14": 6632181556, "15": 6630118638, "16": 6631216020, "17": 6635900986, "18":... | [] | ok | 696,482,702,344 | s698808599 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll n, k;
cin >> n >> k;
int a[200005], r[200005], b[200005];
for(int i = 0; i < n; i++) r[i] = -1;
for(int i = 0; i <= 200000; i++) b[i] = -1;
for(int i = 0; i < n; i++){
cin >>... | {"0": 1921362014, "1": 1922507158, "2": 1922500866, "3": 1922918998, "4": 1922544338, "5": 1924133926, "6": 1923063714, "7": 1924125346, "8": 1924133926, "9": 1923789296, "10": 1923106328, "11": 1924133926, "12": 1923820184, "13": 1923789296, "14": 1923789296, "15": 1921497578, "16": 1922498292, "17": 1924036114, "18":... | ok | 3.448214 | 3.448214 | [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... | 105 | 105 | 105 | 105 | 0 | 34.547753 | false | false | false | 3.467126 | 0.152472 | 0.043977 | 0.02298 | Accepted | Accepted | 0.02298 | 0.837852 | 5 | s724769197 | {"0": 1044319848, "1": 1047046572, "2": 1046704802, "3": 1049029696, "4": 1046682494, "5": 1054025830, "6": 1052030694, "7": 1050585250, "8": 1052681058, "9": 1048508318, "10": 1052583532, "11": 1053575666, "12": 1054019538, "13": 1050540920, "14": 1051066588, "15": 1044855526, "16": 1044908722, "17": 1050535486, "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... | 110,378,606,910 | 6.309943 | 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.