oj.uz

답안 #1115184

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115184 2024-11-20T08:12:16 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 272 ms 32028 KB 
#include <bits/stdc++.h>
#define ll long long 
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define int long long

using namespace std;

const int maxn = 2e5 + 5;

const int mod = 1e9 + 7;

int n;

void webbly_abi_spasibo(){
	
	int m;
	
	cin >> n >> m;
	
	for(int i = 1; i <= n; i++){
		int x;
		cin >> x;
	}
	
	for(int i = 1; i <= m; i++){
		int a,b,c;
		cin >> a >> b >> c;
	}
	
	cout << "1\n0";
	
}

/*

*/

signed main(){
//	
//	freopen("greedy.in", "r", stdin);
//	freopen("greedy.out", "w", stdout);
	
	ios_base::sync_with_stdio(0);
	cin.tie(0);
		
	int tt = 1;
	
	//cin >> tt;
	
	while(tt--){
		webbly_abi_spasibo();
	}
	
	return 0;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 2 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 2 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 272 ms 32028 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 2384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 2 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 2 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -