oj.uz

Submission #923259

# Submission time Handle Problem Language Result Execution time Memory
923259 2024-02-07T03:56:54 Z SpideySpidery Best Place (NOI17_bestplace) C++14
3 / 100
 23 ms 7812 KB 
#include <bits/stdc++.h>

using namespace std;

#define endl "\n"
#define gap " "
#define INF 2e18
#define nl cout<<endl
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
void getIndex(vector<int> v, int K) { auto it = find(v.begin(), v.end(), K); cout << (it != v.end() ? it - v.begin() : -1) << endl; }
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) { cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}'; }
template <typename T>
void __print(const T &x) { int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}"; }
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)

int main() {
  fast_cin();
  int n, x, y;
  cin >> n;
  int sum_x = 0, sum_y = 0;
  vector <vector<int>> coords(n);
  for (int i = 0; i < n; i++) {
      cin>>x>>y;
      sum_x = sum_x + x;
      sum_y = sum_y + y;
      coords[i].push_back(x);
      coords[i].push_back(y);
  }
  cout<<sum_x/n<<gap<<sum_y/n;
  // debug(coords);

  return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 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 392 KB Output is correct

Subtask #2
0 / 20.0

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

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 7000 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

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

Subtask #5
0 / 17.0

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

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 7812 KB Output isn't correct
2 Halted 0 ms 0 KB -