oj.uz

Submission #1089956

# Submission time Handle Problem Language Result Execution time Memory
1089956 2024-09-17T12:26:34 Z solitaryMan Room Temperature (JOI24_ho_t1) C++17
35 / 100
 1 ms 436 KB 
#include <bits/stdc++.h>

using namespace std;
#define endl "\n"
#define ll long long
#define line cout << "---------------------------" << endl;
#define M -1
#define debug(x) cout << "x " << x << endl;
#define all(a) a.begin(), a.end()
#define INF (int) 1e9


bool sq(int n){
	return n * n;
}
void solve(){
	int n,t; cin >> n >> t;
	if(t == 1){
		cout << 0 << endl;
		return;
	}	
	vector<int> v(n);
	bool flg = 0;
	int cnt = 0;
	for(int i = 0; i < n; i++){
		cin >> v[i];
		cnt += v[i] % 2 ;
	}
	cout << (cnt == n or cnt == 0 ? 0 : 1);
// 2
// 1 2 3 4 5
// 1 2 1 2 1
// 1 0 1 0 1
}
int32_t main(){
	int t = 1;
	//cin >> t;
	while(t--){solve();}
	    cerr << "Execution time: " << 1000.f * clock() / CLOCKS_PER_SEC << " ms." << endl;

}

Compilation message

Main.cpp: In function 'bool sq(int)':
Main.cpp:14:11: warning: '*' in boolean context, suggest '&&' instead [-Wint-in-bool-context]
   14 |  return n * n;
      |         ~~^~~
Main.cpp: In function 'void solve()':
Main.cpp:23:7: warning: unused variable 'flg' [-Wunused-variable]
   23 |  bool flg = 0;
      |       ^~~

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #4
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Incorrect 0 ms 348 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -