QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #260785 | #7755. Game on a Forest | smartyi# | WA | 0ms | 3696kb | C++20 | 413b | 2023-11-22 15:16:26 | 2023-11-22 15:16:27 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define Joyfine ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
int _=1;
int n, m;
int a[1111],b[1111];
void solve(int ce){
cin >> n >> m ;
for(int i = 1, u, v; i <= m; i++){
cin >> u >> v;
}
cout << (n + m)/ 2;
}
signed main(void)
{
Joyfine;
//cin>>_;
for(int i=1;i<=_;i++) solve(i);
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3548kb
input:
3 1 1 2
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
4 3 1 2 2 3 3 4
output:
3
result:
ok 1 number(s): "3"
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3696kb
input:
100000 1 4647 17816
output:
50000
result:
wrong answer 1st numbers differ - expected: '1', found: '50000'