Submission #2708481


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int main(){
  int n;
  cin>>n;
  vector<int>den(n),com(n);
  for(int i=0;i<n;i++)
    cin>>com[i];
  for(int i=0;i<n;i++){
    cin>>den[i];
  }
  const int mod = 1000000007;
  int fact[100010]={};
  fact[0]=1;
  for(int i=1;i<=100000;i++)
    fact[i]=(i*fact[i-1])%mod;
  sort(com.begin(),com.end());
  sort(den.begin(),den.end());
  int ccnt=0,dcnt=0;
  int ans=0;
  int cpo=0,dpo=0;
  while(cpo!=n&&dpo!=n){
    
  }
  return 0;
}

Submission Info

Submission Time
Task A - 1D Matching
User shi
Language C++14 (GCC 5.4.1)
Score 0
Code Size 502 Byte
Status TLE
Exec Time 2103 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
TLE × 2
TLE × 14
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt TLE 2103 ms 768 KB
001.txt TLE 2103 ms 384 KB
002.txt TLE 2103 ms 512 KB
003.txt TLE 2103 ms 512 KB
004.txt TLE 2103 ms 896 KB
005.txt TLE 2103 ms 1024 KB
006.txt TLE 2103 ms 1024 KB
007.txt TLE 2103 ms 1024 KB
008.txt TLE 2103 ms 1024 KB
009.txt TLE 2103 ms 1024 KB
010.txt TLE 2103 ms 1024 KB
011.txt TLE 2103 ms 1024 KB
example0.txt TLE 2103 ms 256 KB
example1.txt TLE 2103 ms 256 KB