oj.uz

Submission #538333

# Submission time Handle Problem Language Result Execution time Memory
538333 2022-03-16T15:33:01 Z dantoh000 Hop (COCI21_hop) C++14
110 / 110
 51 ms 5324 KB 
#include <bits/stdc++.h>
using namespace std;
int n;

long long a[1005];

int c[4][4];
int ans[1005][1005];
vector<int> G[4][1005];
int d[4][1005];
int X[1005];

int main(){
    scanf("%d",&n);
    for (int i = 0; i < n; i++){
        scanf("%lld",&a[i]);
        X[i] = 63-__builtin_clzll(a[i]);
        //printf("%d ",X[i]);
    }
    //printf("\n");


    for (int i = 0; i < n; i++){
        for (int j = 0; j < i; j++){
            //printf("final %d %d\n",x,y);
            if ((X[i]>>2ll) == (X[j]>>2ll)) ans[i][j] = 1;
            else if ((X[i]>>4ll) == (X[j]>>4ll)) ans[i][j] = 2;
            else ans[i][j] = 3;
        }
    }
    /*

    for (int i = 0; i < n; i++){
        for (int j = 0; j < i; j++){
            //printf("col %d %d->%d\n",ans[i][j],j,i);
            if (a[i]%a[j] == 0) G[ans[i][j]][i].push_back(j);
        }
    }
    memset(d,0,sizeof(d));
    int maxd = 0;
    for (int i = 1; i <= 3; i++){
        for (int j = 0; j < n; j++){
            for (auto k : G[i][j]){
                d[i][j] = max(d[i][j], d[i][k]+1);
            }
        }
    }

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

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

}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 528 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 400 KB Output is correct

Subtask #2
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 528 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 400 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 46 ms 5324 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 792 KB Output is correct
11 Correct 48 ms 4812 KB Output is correct
12 Correct 45 ms 5292 KB Output is correct
13 Correct 35 ms 4880 KB Output is correct
14 Correct 2 ms 1108 KB Output is correct
15 Correct 37 ms 4892 KB Output is correct
16 Correct 38 ms 4940 KB Output is correct
17 Correct 51 ms 4916 KB Output is correct
18 Correct 36 ms 4880 KB Output is correct
19 Correct 41 ms 4940 KB Output is correct
20 Correct 42 ms 4984 KB Output is correct
21 Correct 36 ms 4968 KB Output is correct
22 Correct 36 ms 4908 KB Output is correct
23 Correct 41 ms 5296 KB Output is correct