2024年

2024年

10月

P1.cpp

#include<bits/stdc++.h>
using namespace std;

int main(){
    int n;cin>>n;
    long long w1,w2,h1,h2;cin>>w1>>w2>>h1>>h2;
    vector<int>v(n,0);
    for(int i=0;i<n;++i){
        int x;
        cin >> x;
        if(i==0){
            v[i]=x;
        }else{
            v[i]=v[i-1]+x;
        }
    }
    //
    long long mH = 0;
    long long nH = 0;
    for(int i=0;i<n;++i){
        long long h = 0;
        if( (v[i]/(w1*w1)) >= h1 ){
            v[i] -= (w1*w1*h1);
            h += h1;
            //
            if( (v[i]/(w2*w2)) >= h2 ){
                h += h2;
            }else{
                h += (v[i]/(w2*w2));
            }
        }else{
            h += (v[i]/(w1*w1));
        }
        mH = max(mH,h-nH);
        nH = h;
    }
    cout << mH << endl;
}

https://zerojudge.tw/ShowProblem?problemid=o711

P2.cpp

#include<bits/stdc++.h>
using namespace std;

int main(){
    int Y,X,k,r,c;cin>>Y>>X>>k>>r>>c;
    vector<vector<int>>g(Y,vector<int>(X,0));
    for(int y=0;y<Y;++y){
        for(int x=0;x<X;++x){
            cin >> g[y][x];
        }
    }
    //
    int y = r;
    int x = c;
    pair<int,int> d[4] = {
        {-1,0},
        {0,1},
        {1,0},
        {0,-1},
    };
    int D = 1;
    pair<int,int> move = d[D];
    //
    int score = 0;
    int cnt = 0;
    while(1){
        
        // step1
        if(g[y][x]==0){
            break;
        }

        // step2
        score += g[y][x];
        g[y][x] -= 1;
        cnt += 1;
        
        // step3
        if(score%k==0){
            D = (D+1)%4;
            move = d[D];
        }

        // step4
        while(y+move.first<0 || y+move.first>=Y || x+move.second<0 || x+move.second>=X || (g[y+move.first][x+move.second]==-1)){
            D = (D+1)%4;
            move = d[D];
        }
        
        // run
        y += move.first;
        x += move.second;
    }
    cout << cnt << endl;
}

https://zerojudge.tw/ShowProblem?problemid=o712

P3.cpp

P4.cpp

06月

P1.cpp

P2.cpp

P3.cpp

#include<bits/stdc++.h>
using namespace std;

map<string,int>m;
bool stop = false;

void back(vector<char>&v,string s,int l){
    if(stop){
        return;
    }
    if(l==0){
        if(m.find(s)==m.end()){
            cout << s << endl;
            stop = true;
        }
        return;
    }
    //
    string temp = s;
    for(char num : v){
        s += num;
        back(v,s,l-1);
        s = temp;
    }
}

int main(){
    string k;cin>>k;
    vector<char>v;
    for(int i=0;i<k.size();++i){
        v.push_back(k[i]);
    }
    int l;cin>>l;
    string s;cin>>s;
    for(int i=0;i<=s.size()-l;++i){
        string n="";
        for(int j=i;j<i+l;++j){
            n+=s[j];
        }
        m[n]=1;
    }
    //
    back(v,"",l);
}

https://zerojudge.tw/ShowProblem?problemid=o078

P4.cpp

01月

P1.cpp

P2.cpp

P3.cpp

P4.cpp