Codeforces Round #517 (Div. 2, based on Technocup 2019 Elimination Round 2)

Codeforces Round #517 (Div. 2, based on Technocup 2019 Elimination Round 2)

 #include <bits/stdc++.h>
 using namespace std;
 
 int n,m,k;
 ;
 
 int main()
 {
     cin>>n>>m>>k;
     ;i<=k-;++i) {
         sum+=(n+(m-))*-(i)*;
     }
     cout<<sum<<endl;
 }

A - Golden Plate

一个三维数组确定一条路径，直接搜就行

 #include<bits/stdc++.h>
 #include<iostream>
 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<vector>
 #include<map>
 #define lson i<<1
 #define rson i<<1|1
 #define LS l,mid,lson
 #define RS mid+1,r,rson
 #define mem(a,x) memset(a,x,sizeof(a))
 #define gcd(a,b) __gcd(a,b)
 #define ll long long
 #define ull unsigned long long
 #define lowbit(x) (x&-x)
 #define pb(x) push_back(x)
 #define enld endl
 #define mian main
 #define itn int
 #define prinft printf
 #pragma GCC optimize(2)
 //#pragma comment(linker, "/STACK:102400000,102400000")
 
 const double PI = acos (-1.0);
 const int INF = 0x3f3f3f3f;
 ;
 ;
 ;
 ;
 
 using namespace std;
 
 int n,cnt,temp;
 int a[MAXN],b[MAXN],ans[MAXN];
 //int a,b;
 ][][];
 
 void init() {
     mem(t,-);
     t[][][]=,t[][][]=;
     t[][][]=,t[][][]=;
     t[][][]=,t[][][]=;
     t[][][]=,t[][][]=;
     t[][][]=,t[][][]=;
     t[][][]=,t[][][]=;
     t[][][]=,t[][][]=;
     t[][][]=,t[][][]=;
     t[][][]=,t[][][]=;
     t[][][]=,t[][][]=;
 }
 
 int main() {
     std::ios::sync_with_stdio(false);
     cin.tie(NULL);
     init();
     while(cin>>n) {
         mem(ans,-);
         ; i<=n-; ++i) {
             cin>>a[i];
         }
         ; i<=n-; ++i) {
             cin>>b[i];
         }
         ; i<=; ++i) {
             temp=i;
             cnt=;
             ans[++cnt]=temp;
             ; j<=n-; ++j) {
                 //cerr<<'#'<<a[j]<<' '<<b[j]<<' '<<temp<<' '<<t[a[j]][b[j]][temp]<<endl;
                 ) {
                     temp=t[a[j]][b[j]][temp];
                     ans[++cnt]=temp;
                 } else {
                     cnt=;
                     break;
                 }
             }
             if(cnt==n)
                 break;
         }
         if(cnt==n) {
             cout<<"YES"<<endl;
             ; i<=n; ++i) {
                 )
                     cout<<' ';
                 cout<<ans[i];
             }
             cout<<endl;
         } else
             cout<<"NO"<<endl;
     }
 
     ;
 }

B - Curiosity Has No Limits

二分+贪心（只要n在a+b的范围内，所有的数都可以放进去）

 #include<bits/stdc++.h>
 #include<iostream>
 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<vector>
 #include<map>
 #define lson i<<1
 #define rson i<<1|1
 #define LS l,mid,lson
 #define RS mid+1,r,rson
 #define mem(a,x) memset(a,x,sizeof(a))
 #define gcd(a,b) __gcd(a,b)
 #define ll long long
 #define ull unsigned long long
 #define lowbit(x) (x&-x)
 #define pb(x) push_back(x)
 #define enld endl
 #define mian main
 #define itn int
 #define prinft printf
 #pragma GCC optimize(2)
 //#pragma comment(linker, "/STACK:102400000,102400000")
 
 const double PI = acos (-1.0);
 const int INF = 0x3f3f3f3f;
 ;
 ;
 ;
 ;
 
 using namespace std;
 
 ll a,b,n,m;
 
 bool check(ll m) {
     )/>(a+b))
         return true;
     else
         return false;
 }
 
 ll ans1[MAXN],ans2[MAXN];
 
 int main() {
     //std::ios::sync_with_stdio(false);
     //cin.tie(NULL);
 
     while(cin>>a>>b) {
         ll l=-,r=*sqrt(a+b);
         ; i<=; ++i) {
             m=(l+r)/;
             if(check(m))
                 r=m-;
             else
                 n=m,l=m+;
         }
         cerr<<n<<endl;
         ll cnt1=,cnt2=;
         ; i--) {
             if(i<=a) {
                 ans1[++cnt1]=i;
                 a-=i;
             } else {
                 ans2[++cnt2]=i;
                 b-=i;
             }
         }
 
         cout<<cnt1<<endl;
         ; i<=cnt1; ++i) {
             )
                 cout<<' ';
             cout<<ans1[i];
         }
         cout<<endl<<cnt2<<endl;
         ; i<=cnt2; ++i) {
             )
                 cout<<' ';
             cout<<ans2[i];
         }
         cout<<endl;
 
     }
 
     ;
 }

C - Cram Time