diff --git a/day1/P5686/P5686 b/day1/P5686/P5686 deleted file mode 100755 index 1844c4f..0000000 Binary files a/day1/P5686/P5686 and /dev/null differ diff --git a/day1/PreSim/main b/day1/PreSim/main deleted file mode 100755 index 3392cc6..0000000 Binary files a/day1/PreSim/main and /dev/null differ diff --git a/day1/U234197/U234197 b/day1/U234197/U234197 deleted file mode 100755 index 2056431..0000000 Binary files a/day1/U234197/U234197 and /dev/null differ diff --git a/day1/learn/test_cpp_io b/day1/learn/test_cpp_io deleted file mode 100755 index 332a614..0000000 Binary files a/day1/learn/test_cpp_io and /dev/null differ diff --git a/day2/P7514/P7514 b/day2/P7514/P7514 deleted file mode 100755 index 6e9e78c..0000000 Binary files a/day2/P7514/P7514 and /dev/null differ diff --git a/day2/P7514/chat b/day2/P7514/chat deleted file mode 100755 index 72f6bc1..0000000 Binary files a/day2/P7514/chat and /dev/null differ diff --git a/day2/U111091/U111091 b/day2/U111091/U111091 deleted file mode 100755 index bb6ce70..0000000 Binary files a/day2/U111091/U111091 and /dev/null differ diff --git a/day2/U111091/chat b/day2/U111091/chat deleted file mode 100755 index 0ba0b26..0000000 Binary files a/day2/U111091/chat and /dev/null differ diff --git a/day2/U111091/tempCodeRunnerFile b/day2/U111091/tempCodeRunnerFile deleted file mode 100755 index bc7ca98..0000000 Binary files a/day2/U111091/tempCodeRunnerFile and /dev/null differ diff --git a/day2/U111091/tempCodeRunnerFile.cpp b/day2/U111091/tempCodeRunnerFile.cpp deleted file mode 100644 index 467ac47..0000000 --- a/day2/U111091/tempCodeRunnerFile.cpp +++ /dev/null @@ -1,79 +0,0 @@ -#include -using namespace std; -#define int long long - -const int MAX_N = 10'0000; -int times; - -int x[MAX_N]; -int l[MAX_N]; -int prefix_r[MAX_N]; -int r[MAX_N]; - -// void debug_array(int array[],size_t size,string name){ -// cout<<"\n"<>times; - for(int t=1;t<=times;t++){ - - int n,k,m; - cin>>n>>k>>m; - for (int i=1; i<=n; i++) { - cin>>x[i]; - } - - string s; - cin>>s; - int sum=0,cnt=0; - vector v; - int last0=1; - for (int i=2; i<=n; i++) { - if(s[i-2]=='0') - { - int dif=x[i-1]-x[last0]; - sum+=dif; - cnt+=dif/m; - v.push_back(dif%m); - last0=i; - } - } - int dif=x[n]-x[last0]; - sum+=dif; - cnt+=dif/m; - v.push_back(dif%m); - sort(v.begin(),v.end(),greater()); - if(k<=cnt) - { - sum-=k*m; - } - else - { - sum-=cnt*m; - k-=cnt; - for(int j:v) - { - if(k==0) - { - break; - } - sum-=min(j,m); - k--; - } - } - cout<