oj.uz

Submission #537769

# Submission time Handle Problem Language Result Execution time Memory
537769 2022-03-15T13:34:01 Z jamezzz Hop (COCI21_hop) C++17
110 / 110
 27 ms 1288 KB 
#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
typedef long long ll;

int n,pos[1005];
ll x[1005];

int main(){
	sf("%d",&n);
	for(int i=1;i<=n;++i)sf("%lld",&x[i]);
	for(int i=1;i<=n;++i){
		pos[i]=1;
		for(int j=1;j<i;++j){
			if(x[i]%x[j]==0)pos[i]=max(pos[i],pos[j]+1);
		}
	}
	for(int i=2;i<=n;++i){
		for(int j=1;j<i;++j){
			if(x[i]%x[j]!=0){
				pf("1 ");
				continue;
			}
			if(pos[i]/4==pos[j]/4)pf("1 ");
			else if(pos[i]/16==pos[j]/16)pf("2 ");
			else pf("3 ");
		}
		pf("\n");
	}
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:12:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  sf("%d",&n);
      |    ^
Main.cpp:13:25: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  for(int i=1;i<=n;++i)sf("%lld",&x[i]);
      |                         ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #2
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 20 ms 1288 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 18 ms 1040 KB Output is correct
12 Correct 21 ms 1252 KB Output is correct
13 Correct 20 ms 1100 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 18 ms 1128 KB Output is correct
16 Correct 18 ms 1108 KB Output is correct
17 Correct 21 ms 1128 KB Output is correct
18 Correct 21 ms 1076 KB Output is correct
19 Correct 24 ms 1184 KB Output is correct
20 Correct 18 ms 1108 KB Output is correct
21 Correct 18 ms 1152 KB Output is correct
22 Correct 27 ms 1160 KB Output is correct
23 Correct 19 ms 1208 KB Output is correct