Submission #537638

#	Time	Username	Problem	Language	Result	Execution time	Memory
537638		dantoh000	Hop (COCI21_hop)	C++14	0 / 110	1 ms	468 KiB

Main

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

int a[1005];

int c[3][3];
int ans[1005][1005];
vector<int> G[3][1005];
int d[3][1005];
void dfs(int u, int c){
    for (auto v : G[c][u]){
        d[c][v] = d[c][u]+1;
        dfs(v,c);
    }
}
int main(){
    scanf("%d",&n);
    for (int i = 0; i < n; i++){
        scanf("%d",&a[i]);
    }
    c[0][1] = 1;
    c[0][2] = 2;
    c[1][0] = 3;
    c[1][2] = 2;
    c[2][0] = 3;
    c[2][1] = 1;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < i; j++){
            if (i%3 == j%3){
                int x = i-i%3;
                int y = j-j%3;
                while (x%3 == 0 && y%3 == 0){
                    x/=3;
                    y/=3;
                }
                ans[i][j] = c[x%3][y%3];

            }
            else{
                ans[i][j] = c[i%3][j%3];
            }
        }
    }
    /*
    for (int i = 0; i < n; i++){
        for (int j = 0; j < i; j++){
            G[c[i][j]][i].push_back(j);
        }
    }
    for (int i = 1; i <= 3; i++){
        for (int j = n-1; j >= 0; j--){
            if (d[i][j] == 0) dfs(j,i);

        }
    }
    for (int i = 1; i <= 3; i++){
        for (int j = 0; j < n; j++){
            printf("%d ",d[i][j]);
        }
        printf("\n");
    }*/

    for (int i = 0; i < n; i++){
        for (int j = 0; j < i; j++){
            printf("%d ",ans[i][j]);
        }
        printf("\n");
    }

}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
Main.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         scanf("%d",&a[i]);
      |         ~~~~~^~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 100