提交记录 10325


用户 题目 状态 得分 用时 内存 语言 代码长度
EntropyIncreaser noi19a. 【NOI2019】回家路线 Compile Error 0 0 ns 0 KB C++ 1.10 KB
提交时间 评测时间
2019-09-17 16:50:10 2020-08-01 02:07:09
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cstring>

#include <algorithm>
#include <numeric>
#include <functional>

#define LOG(FMT...) fprintf(stderr, FMT)

using namespace std;

typedef long long ll;

struct Vec {
  int x, y;
  
  Vec() : x(0), y(0) {}
  Vec(int x, int y) : x(x), y(y) {}
  
  Vec operator+(const Vec& rhs) const { return Vec(x + rhs.x, y + rhs.y); }
  Vec operator-() const { return Vec(-x, -y); }
  Vec operator-(const Vec& rhs) const { return *this + (-rhs); } 
  
  ll operator*(const Vec& rhs) const { return x * (ll)rhs.y - y * (ll)rhs.x; }
  ll operator^(const Vec& rhs) const { return x * (ll)rhs.x + y * (ll)rhs.y; }
};

const int N = 100010, M = 200010, K = 1010;

int n, m, A, B, C; 
int x[M], y[M], p[M], q[M], res[M];

vector<int> start[K], dest[K];

int main() {
//  freopen("test.in", "r", stdin);
//  freopen("test.out", "w", stdout);
  
  scanf("%d%d%d%d%d", &n, &m, &A, &B, &C);
  for (int i = 1; i <= m; ++i) {
    scanf("%d%d%d%d", &x[i], &y[i], &p[i], &q[i]);
    start[p[i]].push_back(i);
    dest[q[i]].push_back(i);
  }
  int ans = -1;
  
  
  return 0;
}

CompilationN/AN/ACompile ErrorScore: N/A


Judge Duck Online | 评测鸭在线
Server Time: 2026-03-29 18:16:09 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠