oj.uz

Submission #538282

# Submission time Handle Problem Language Result Execution time Memory
538282 2022-03-16T13:31:04 Z jamielim Hop (COCI21_hop) C++14
110 / 110
 64 ms 5604 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ii,ii> i4;
const int MOD=1000000007;
const int INF=1012345678;
const ll LLINF=1012345678012345678LL;
const double PI=3.1415926536;
const double EPS=1e-14;

int n;
ll arr[1005];
int ans[1005][1005];
set<int> adj[1005]; // graph of division thingy is a dag
int dist[1005];

int main(){
	scanf("%d",&n);
	for(int i=0;i<n;i++)scanf("%lld",&arr[i]);
	memset(ans,-1,sizeof(ans));
	for(int i=1;i<n;i++){
		for(int j=0;j<i;j++){
			if(arr[i]%arr[j]!=0){
				ans[j][i]=3;
			}else{
				adj[j].insert(i);
			}
		}
	}
	
	for(int i=0;i<n;i++){
		for(int j:adj[i]){
			dist[j]=max(dist[j],dist[i]+1);
		}
	}
	
	for(int i=0;i<n;i++){
		for(int j:adj[i]){
			if(dist[j]/4==dist[i]/4)ans[i][j]=1;
			else if(dist[j]/16==dist[i]/16)ans[i][j]=2;
			else ans[i][j]=3;
		}
	}
	
	for(int i=1;i<n;i++){
		for(int j=0;j<i;j++){
			printf("%d ",ans[j][i]);
		}
		printf("\n");
	}
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:26:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
Main.cpp:27:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |  for(int i=0;i<n;i++)scanf("%lld",&arr[i]);
      |                      ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 46 ms 5380 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 3 ms 4308 KB Output is correct
11 Correct 40 ms 5412 KB Output is correct
12 Correct 64 ms 5384 KB Output is correct
13 Correct 39 ms 5392 KB Output is correct
14 Correct 4 ms 4436 KB Output is correct
15 Correct 42 ms 5604 KB Output is correct
16 Correct 43 ms 5492 KB Output is correct
17 Correct 53 ms 5424 KB Output is correct
18 Correct 47 ms 5452 KB Output is correct
19 Correct 42 ms 5568 KB Output is correct
20 Correct 50 ms 5440 KB Output is correct
21 Correct 53 ms 5324 KB Output is correct
22 Correct 44 ms 5392 KB Output is correct
23 Correct 45 ms 5372 KB Output is correct