Submission #1235851

#	Time	Username	Problem	Language	Result	Execution time	Memory
1235851		matisito	Spirale (COCI18_spirale)	C++20	72 / 80	1092 ms	1060 KiB

spirale

#include <iostream>
#include <iomanip>
#include <string>
#include <math.h>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <cassert>

using namespace std;
#define dbg(x) cerr<<#x<<": "<<x<<"\n";

/*  
I love Valentina Notta uwuwuwu
*/

bool in(int x, int y, int n, int m){
    return x>=1 && y>=1 && x<=n && y<=m;
}

void solve(){
    int n, m, k; cin>>n>>m>>k;
    vector<vector<int>>ans(n+1, vector<int>(m+1, 1e9));
    vector<vector<pair<int, int>>>move(2, vector<pair<int, int>>(4));
    for(int i=0 ; i<4 ; i++){
        if(i==0){
            move[0][i]={0, 1};
            move[1][i]={0, -1};
        }else if(i==1){
            move[0][i]={1, 0};
            move[1][i]={1, 0};
        }else if(i==2){
            move[0][i]={0, -1};
            move[1][i]={0, 1};
        }else{
            move[0][i]={-1, 0};
            move[1][i]={-1, 0};
        }
    }
    for(int valenottauwu=0 ; valenottauwu<k ; valenottauwu++){
        int x, y, t; cin>>x>>y>>t;
        int lleno;
        map<pair<int, int>, bool>freq;
        freq[{x, y}]=1;
        ans[x][y]=min(ans[x][y], 1);
        freq[{x-1, y}]=1;
        if(in(x-1, y, n, m)){
            lleno=2;
            ans[x-1][y]=min(ans[x-1][y], 2);
        }else lleno=1;
        x--;
        int curr=0, num=2;
        while(1){
            x+=move[t][curr].first;
            y+=move[t][curr].second;
            num++;
            freq[{x, y}]=1;
            if(in(x, y, n, m)){
                ans[x][y]=min(ans[x][y], num);
                lleno++;
            }
            int next=(curr+1)%4;
            if(freq[{x+move[t][next].first, y+move[t][next].second}]==0){
                curr=next;
            }
            if(lleno>=n*m) break;
        }
    }
    for(int i=1 ; i<=n ; i++){
        for(int j=1 ; j<=m ; j++) cout<<ans[i][j]<<" ";
        cout<<"\n";
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}

• Subtask 1: 72 / 80